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

28 points by johnjwang 10 months ago · 7 comments

Reader

5 threads

abtoronto 10 months ago

This is great!

minhtuev 10 months ago

Scheduling is a fun problem

arietty 10 months ago

This is fantastic!

tallpauldoll 10 months ago

NP =\= P

johnjwangOP 10 months 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 10 months ago

wow, great breakdown!

Settings