1480 search results - page 65 / 296 » Ants can solve constraint satisfaction problems |
176
click to vote
AAAI
2000
15 years 7 months ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
177
click to vote
AAAI
1997
15 years 7 months ago
1997
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
180
click to vote
AI
1999
Springer
15 years 6 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
122
click to vote
CP
2007
Springer
16 years 14 days ago
2007
Springer
In this paper we present new techniques for improving backtracking based Quantified Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which variab...
131
click to vote
ICTAI
2008
IEEE
16 years 21 days ago
2008
IEEE
In this paper, we develop heuristics for finding good starting points when solving large-scale nonlinear constrained optimization problems (COPs). We focus on nonlinear programmi...