6 ms·
Old school AI isn't dead: How we achieved a 12× speedup on an NP hard problem
- aebrrrr 11mo ago[dead]
- tallpauldoll 11mo agoNP =\= P
- johnjwang 11mo agoVery 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 11mo agowow, great breakdown!
- minhtuev 11mo agoScheduling is a fun problem
- abtoronto 11mo agoThis is great!
- arietty 11mo agoThis is fantastic!