1149 search results - page 110 / 230 » Comparing parameter tuning methods for evolutionary algorith... |
109
click to vote
CEC
2003
IEEE
15 years 8 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
138
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
The importance of mutation varies across evolutionary computation domains including: genetic programming, evolution strategies, and genetic algorithms. In the genetic programming ...
109
Voted
SODA
2001
ACM
15 years 4 months ago
2001
ACM
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
This paper tackles the problem of fitting multiple instances of a model to data corrupted by noise and outliers. The proposed solution is based on random sampling and conceptual da...
110
click to vote
CPAIOR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific ...