137 search results - page 1 / 28 » Coarse-Graining in Genetic Algorithms: Some Issues and Examp... |
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, givi...
DAGSTUHL
2006
13 years 6 months ago
2006
One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this iss...
ECIR
2009
Springer
14 years 2 months ago
2009
Springer
The aim of query-based sampling is to obtain a sufficient, representative sample of an underlying (text) collection. Current measures for assessing sample quality are too coarse gr...
CODES
2004
IEEE
13 years 8 months ago
2004
IEEE
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in DFG represents a coarse grain block such as FIR and...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
This paper discusses the implementation of local search in evolutionary multiobjective optimization (EMO) algorithms for the design of a simple but powerful memetic EMO algorithm. ...