ec.europa.eu The common fisheries policy is set by the Council of Ministers down to the tiniest deta...
UCLA presents the Storefront Genome, a symposium that examines the social, medical and legal aspects...
Lecture series on Project and Production Management by Prof. Arun kanda, Department of Mechanical En...
Analysis of the Biological Clock Decision
Lecture series on Project and Production Management by Prof. Arun kanda, Department of Mechanical En...
citeseer |
(0) (0 Votes)
|
Views: (1073) Date: (13-05-09) Pages: () |
Abstract: Abstract. Solving constraint optimization problems is hard because it is not enough to find the best solution; an algorithm does not know a candidate is the best solution until it has proven that there are no better solutions. The proof can be long, compared to the time spent to find a good solution. In the cases where there are resource bounds, the proof of optimality may not be achievable and a tradeoff needs to be made between the solution quality and the cost due to the time delay. We propose a decision theoretic meta-reasoning-guide d COP solver to address this issue. By choosing the action with the estimated maximal expected utility, the meta-reasoner finds a stopping point with a good tradeoff between the solution quality and the time cost. 1.