Old school AI isn't dead: How we achieved a 12× speedup on an NP hard problem (assembled.com)

28 points by johnjwang 9mo ago ↗ HN

6 comments

[ 2.6 ms ] story [ 24.4 ms ] thread

tallpauldoll 9mo ago ↗

NP =\= P

joyyun 9mo ago ↗

wow, great breakdown!

minhtuev 9mo ago ↗

Scheduling is a fun problem

abtoronto 9mo ago ↗

This is great!

arietty 8mo ago ↗

This is fantastic!

[dead] aebrrrr 8mo ago ↗

[dead]