741 search results - page 40 / 149 » Robust Constraint Solving Using Multiple Heuristics |
CP
2006
Springer
14 years 1 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
ECAI
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
ATAL
2007
Springer
14 years 4 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
ICIP
1999
IEEE
14 years 11 months ago
1999
IEEE
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...