Sciweavers

1914 search results - page 30 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
AI
2002
Springer
13 years 8 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo
VLDB
2007
ACM
114views Database» more  VLDB 2007»
14 years 8 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
14 years 4 days ago
Pairwise sequence comparison for fitness evaluation in evolutionary structural software testing
Evolutionary algorithms are among the metaheuristic search methods that have been applied to the structural test data generation problem. Fitness evaluation methods play an import...
H. Turgut Uyar, A. Sima Etaner-Uyar, A. Emre Harma...
ADBIS
2001
Springer
114views Database» more  ADBIS 2001»
14 years 1 months ago
Evaluation of Join Strategies for Distributed Mediation
Three join algorithms are evaluated in an environment with distributed main-memory based mediators and data sources. A streamed ship-out join ships bulks of tuples to a mediator ne...
Vanja Josifovski, Timour Katchaounov, Tore Risch
AAAI
1994
13 years 9 months ago
Evolving Neural Networks to Focus Minimax Search
Neural networks were evolved through genetic algorithms to focus minimax search in the game of Othello. At each level of the search tree, the focus networks decide which moves are...
David E. Moriarty, Risto Miikkulainen