1914 search results - page 27 / 383 » Evaluation of a Catalytic Search Algorithm |
CG
2006
Springer
14 years 6 days ago
2006
Springer
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
ACG
2003
Springer
14 years 1 months ago
2003
Springer
This article presents the results of an empirical experiment designed to gain insight into what is the effect of the minimax algorithm on the evaluation function. The experiment’...
ILP
2004
Springer
14 years 1 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
We benchmark the pure random search algorithm on the BBOB 2009 noise-free testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space di...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
We benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space dimensi...