1830 search results - page 33 / 366 » Optimizing Sorting with Genetic Algorithms |
EUROGP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we propose an approach to Genetic Programming based on code reuse and we test it in the design of combinational logic circuits at the gate-level. The circui...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
We present a genetic model based on simulated recombination of fixed sequences of quaternary genes (assuming four distinct forms, or alleles). States and dynamics of the infinite ...
EUROGP
2007
Springer
15 years 3 months ago
2007
Springer
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
109
click to vote
SAC
2011
ACM
14 years 16 days ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Mobile ad hoc networks are typically designed and evaluated in generic simulation environments. However the real conditions in which these networks are deployed can be quite diff...