2343 search results - page 84 / 469 » Visual-Concept Search Solved |
138
click to vote
CSCLP
2005
Springer
15 years 10 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
145
click to vote
EMO
2003
Springer
15 years 9 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
156
click to vote
CSR
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
125
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
131
Voted
GECCO
2000
Springer
15 years 8 months ago
2000
Springer
The integration of genetic algorithms (GAs) and tabu search is one of traditional problems in function optimization in the GA literature. However, most proposed methods have utili...