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

Y	Hacker News new \| ask \| show \| jobs

	Old school AI isn't dead: How we achieved a 12× speedup on an NP hard problem (assembled.com)
	28 points by johnjwang 243 days ago

5 comments

This is great!

Scheduling is a fun problem

This is fantastic!

NP =\= P

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

wow, great breakdown!