4 search results - page 1 / 1 » Extending Dynamic Backtracking to Solve Weighted Conditional... |
AAAI
2006
13 years 6 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
FLAIRS
2008
13 years 7 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
AAAI
2000
13 years 6 months ago
2000
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
CP
2006
Springer
13 years 8 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...