Sciweavers

2310 search results - page 10 / 462
» The selection efficiency of tournaments
Sort
View
MSS
2008
IEEE
118views Hardware» more  MSS 2008»
13 years 7 months ago
Computing the minimal covering set
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
Felix Brandt, Felix A. Fischer
ACG
2006
Springer
14 years 1 months ago
Automatic Generation of Search Engines
A plethora of enhancements are available to be used together with the αβ search algorithm. There are so many, that their selection and implementation is a non-trivial task, even ...
Markian Hlynka, Jonathan Schaeffer
GECCO
2004
Springer
115views Optimization» more  GECCO 2004»
14 years 28 days ago
Parameter-Less Hierarchical BOA
Abstract. The parameter-less hierarchical Bayesian optimization algorithm (hBOA) enables the use of hBOA without the need for tuning parameters for solving each problem instance. T...
Martin Pelikan, Tz-Kai Lin
FOGA
2011
12 years 11 months ago
On the movement of vertex fixed points in the simple GA
The Vose dynamical system model of the simple genetic algorithm models the behavior of this algorithm for large population sizes and is the basis of the exact Markov chain model. ...
Alden H. Wright, Tomás Gedeon, J. Neal Rich...
PRL
2006
130views more  PRL 2006»
13 years 7 months ago
Efficient huge-scale feature selection with speciated genetic algorithm
With increasing interest in bioinformatics, sophisticated tools are required to efficiently analyze gene information. The classification of gene expression profiles is crucial in ...
Jin-Hyuk Hong, Sung-Bae Cho