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

23 pointsposted 15 hours ago
by johnjwang
(assembled.com)

6 Comments

arietty

4 hours ago

This is fantastic!

minhtuev

15 hours ago

Scheduling is a fun problem

tallpauldoll

15 hours ago

NP =\= P

johnjwang

15 hours ago

Very true, and I promise we didn’t solve P vs NP over lunch :). We just got much better at not exploring useless parts of the tree

joyyun

15 hours ago

wow, great breakdown!