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

28 points by johnjwang 213 days ago | 6 comments

abtoronto 213 days ago |

This is great!

minhtuev 213 days ago |

Scheduling is a fun problem

arietty 212 days ago |

This is fantastic!

tallpauldoll 213 days ago |

NP =\= P

johnjwang 213 days 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 213 days ago |

wow, great breakdown!