129 search results - page 14 / 26 » Tightness Time for the Linkage Learning Genetic Algorithm |
100
click to vote
BMCBI
2007
14 years 10 months ago
2007
Background: Answers to several fundamental questions in statistical genetics would ideally require knowledge of the ancestral pedigree and of the gene flow therein. A few examples...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Evaluating GP schema in context is considered to be a complex, and, at times impossible, task. The tightly linked nodes of a GP tree is the main reason behind its complexity. This...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...