566 search results - page 37 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
CP
1997
Springer
15 years 4 months ago
1997
Springer
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
102
Voted
CP
2007
Springer
15 years 6 months ago
2007
Springer
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...
114
Voted
AIPS
2006
15 years 1 months ago
2006
Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan traj...
86
Voted
SSD
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we study the evaluation of continuous constraint queries (CCQs) for spatiotemporal streams. A CCQ triggers an alert whenever a configuration of constraints between s...
102
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
This paper proposes a technique for estimating piecewise planar models of objects from their images and geometric constraints. First, assuming a bounded noise in the localization ...