Sciweavers

894 search results - page 89 / 179
» Parameter-less evolutionary search
Sort
View
135
Voted
GECCO
2004
Springer
15 years 11 months ago
Distributed Constraint Satisfaction, Restricted Recombination, and Hybrid Genetic Search
In this paper, we present simple and genetic forms of an evolutionary paradigm known as a society of hill-climbers (SoHC). We compare these simple and genetic SoHCs on a test suite...
Gerry V. Dozier, Hurley Cunningham, Winard Britt, ...
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
15 years 7 months ago
Stochastic local search in continuous domains: questions to be answered when designing a novel algorithm
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
Petr Posik
ECAI
2006
Springer
15 years 7 months ago
Calibrating Probability Density Forecasts with Multi-Objective Search
Abstract. In this paper, we show that the optimization of density forecasting models for regression in machine learning can be formulated as a multi-objective problem. We describe ...
Michael Carney, Padraig Cunningham
DAM
2008
115views more  DAM 2008»
15 years 5 months ago
Variable space search for graph coloring
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey
ICST
2011
IEEE
14 years 9 months ago
It is Not the Length That Matters, It is How You Control It
—The length of test cases is a little investigated topic in search-based test generation for object oriented software, where test cases are sequences of method calls. While intui...
Gordon Fraser, Andrea Arcuri