Sciweavers

AAAI
2008
13 years 6 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
ICML
1994
IEEE
13 years 7 months ago
A Conservation Law for Generalization Performance
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Cullen Schaffer
ECAI
2006
Springer
13 years 8 months ago
Random Subset Optimization
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
Boi Faltings, Quang Huy Nguyen
CP
2006
Springer
13 years 8 months ago
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...
CG
2006
Springer
13 years 8 months ago
A Skat Player Based on Monte-Carlo Simulation
We apply Monte Carlo simulation and alpha-beta search to the card game of Skat, which is similar to Bridge, but different enough to require some new algorithmic ideas besides the t...
Sebastian Kupferschmid, Malte Helmert
CCGRID
2004
IEEE
13 years 8 months ago
Search performance analysis and robust search algorithm in unstructured peer-to-peer networks
Recently Peer-to-Peer networks (P2P) have gained great attention and popularity. One key challenging aspect in a P2P resource sharing environment is an efficient searching algorit...
Tsungnan Lin, Hsinping Wang, Jianming Wang
BIRD
2007
Springer
13 years 8 months ago
Fast Search Algorithms for Position Specific Scoring Matrices
Fast search algorithms for finding good instances of patterns given as position specific scoring matrices are developed, and some empirical results on their performance on DNA sequ...
Cinzia Pizzi, Pasi Rastas, Esko Ukkonen
ECAI
2000
Springer
13 years 8 months ago
A Property of Path Inverse Consistency Leading to an Optimal PIC Algorithm
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
Romuald Debruyne
RR
2009
Springer
13 years 9 months ago
Search for More Declarativity
Abstract. Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed searc...
Simon Brodt, François Bry, Norbert Eisinger
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
13 years 9 months ago
BBOB-benchmarking two variants of the line-search algorithm
The restarted line search, or coordinate-wise search, algorithm is tested on the BBOB 2009 testbed. Two different univariate search algorithms (fminbnd from MATLAB and STEP) were...
Petr Posik