693 search results - page 8 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
108
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
118
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
127
Voted
NIPS
2007
15 years 3 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
106
Voted
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
130
Voted
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...