Sciweavers

711 search results - page 52 / 143
» An Empirical Comparison of Selection Methods in Evolutionary...
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
AAAI
2000
13 years 9 months ago
Performance Comparison of Landmark Recognition Systems for Navigating Mobile Robots
Self-localisation is an essential competence for mobile robot navigation. Due to the fundamental unreliability of dead reckoning, a robot must depend on its perception of external...
Tom Duckett, Ulrich Nehmzow
CP
2011
Springer
12 years 7 months ago
Algorithm Selection and Scheduling
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, ...
PKDD
2007
Springer
121views Data Mining» more  PKDD 2007»
14 years 1 months ago
Improved Algorithms for Univariate Discretization of Continuous Features
In discretization of a continuous variable its numerical value range is divided into a few intervals that are used in classification. For example, Na¨ıve Bayes can benefit from...
Jussi Kujala, Tapio Elomaa
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
14 years 2 months ago
Three interconnected parameters for genetic algorithms
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
Pedro A. Diaz-Gomez, Dean F. Hougen