40 search results - page 6 / 8 » Coevolutionary Genetic Algorithms for Solving Dynamic Constr... |
AI
2000
Springer
13 years 8 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
ECAI
1992
Springer
14 years 2 days ago
1992
Springer
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
FLAIRS
2008
13 years 11 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...
AI
1999
Springer
13 years 8 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...
CP
2000
Springer
14 years 27 days ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...