Sciweavers

506 search results - page 41 / 102
» Automated Search for Heuristic Functions
Sort
View
IJCAI
1989
13 years 8 months ago
The Reason for the Benefits of Minimax Search
based on an abstract concept of quiescence. In the following we sketch this and a related model, describe the design of our experiments, and present the results of our simulation s...
Anton Scheucher, Hermann Kaindl
SEBD
2000
112views Database» more  SEBD 2000»
13 years 9 months ago
Correct and efficient evaluation of region-based image search
Abstract. Content-based image retrieval systems allow the user to interactively search image databases looking for those images which are similar to a specified query image. To thi...
Ilaria Bartolini, Marco Patella
AAAI
2006
13 years 9 months ago
Sample-Efficient Evolutionary Function Approximation for Reinforcement Learning
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
Shimon Whiteson, Peter Stone
BMCBI
2006
178views more  BMCBI 2006»
13 years 7 months ago
MannDB - A microbial database of automated protein sequence analyses and evidence integration for protein characterization
Background: MannDB was created to meet a need for rapid, comprehensive automated protein sequence analyses to support selection of proteins suitable as targets for driving the dev...
Carol L. Ecale Zhou, Marisa Lam, Jason Smith, Adam...
GECCO
2010
Springer
197views Optimization» more  GECCO 2010»
13 years 11 months ago
Niching the CMA-ES via nearest-better clustering
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...
Mike Preuss