2343 search results - page 177 / 469 » Visual-Concept Search Solved |
128
click to vote
SGAI
2007
Springer
15 years 11 months ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
136
Voted
CP
2005
Springer
15 years 10 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
143
Voted
CP
2005
Springer
15 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...
140
Voted
EGC
2005
Springer
15 years 10 months ago
2005
Springer
Genetic algorithms (GAs) are stochastic search methods that have been successfully applied in many search, optimization, and machine learning problems. Their parallel counterpart (...
153
click to vote
ICANN
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Swarm Intelligence (SI) is the property of a system whereby the collective behaviors of (unsophisticated) entities interacting locally with their environment cause cohere...