Sciweavers

627 search results - page 41 / 126
» How optimal is the genetic code
Sort
View
99
Voted
CIBCB
2007
IEEE
15 years 4 months ago
Hybrid Architecture for Accelerating DNA Codeword Library Searching
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
Qinru Qiu, Daniel J. Burns, Qing Wu, Prakash Mukre
99
Voted
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
15 years 7 months ago
A hybrid genetic algorithm for a variant of two-dimensional packing problem
A variant of two-dimensional packing problem was given in the GECCO’2008 competition. This paper describes the genetic algorithm that produced the best result and thus won the N...
Jin Kim, Byung Ro Moon
87
Voted
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 6 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
GECCO
2003
Springer
15 years 6 months ago
Effective Use of Directional Information in Multi-objective Evolutionary Computation
While genetically inspired approaches to multi-objective optimization have many advantages over conventional approaches, they do not explicitly exploit directional/gradient informa...
Martin Brown, Robert E. Smith
100
Voted
EUROGP
2000
Springer
115views Optimization» more  EUROGP 2000»
15 years 4 months ago
Evolution of a Controller with a Free Variable Using Genetic Programming
A mathematical formula containing one or more free variables is "general" in the sense that it provides a solution to an entire category of problems. For example, the fa...
John R. Koza, Jessen Yu, Martin A. Keane, William ...