882 search results - page 97 / 177 » Local Search for Very Large SAT Problems |
138
click to vote
GECCO
2000
Springer
15 years 7 months ago
2000
Springer
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
109
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
We investigate how a niching based evolutionary algorithm fares on the BBOB function test set, knowing that most problems are not very well suited to this algorithm class. However...
119
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
We address the problem of large scale image retrieval in a wide-baseline setting, where for any query image all the matching database images will come from very different viewpoint...
147
click to vote
HIPC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper investigates the problem of autonomously allocating a large number of independent, equal sized tasks on a distributed heterogeneous grid-like platform, using o...
137
click to vote
CP
2000
Springer
15 years 8 months 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...