39 search results - page 2 / 8 » Light Algorithms for Maintaining Max-RPC During Search |
ECAI
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. When Genetic Algorithms (GAs) are employed in multimodal function optimization, engineering and machine learning, identifying multiple peaks and maintaining subpopulation...
SOCO
2012
Springer
12 years 25 days ago
2012
Springer
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
IJCAI
2007
13 years 6 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
CP
2005
Springer
13 years 10 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...