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