News for hackers. Stuff that matters.
Re:The Prolog Story by pdany on Thursday May 20, 2010 @05:37PM (#1365519)
I never participated in IOI, but at least in ACM contests I have never seen a problem where suboptimal heuristic search was allowed.
Re:The Prolog Story by barrkel on Thursday May 20, 2010 @06:10PM (#1365619)
Now we're mixing up two criteria. Contest problems are small enough that an optimal solution can be found in reasonable time; but since packing problems usually end up NP complete or NP hard, in the real world you'll end up using heuristics.