25 search results - page 4 / 5 » Assembly of Puzzles Using a Genetic Algorithm |
101
Voted
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
A number of recent studies introduced meta-evolutionary strategies and successfully used them for solving problems in genetic programming. While individual results indicate possib...
125
Voted
GECCO
2005
Springer
2005
Springer
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
15 years 7 months ago
This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...
125
Voted
BMCBI
2010
15 years 2 months ago
2010
Background: The most common application for the next-generation sequencing technologies is resequencing, where short reads from the genome of an individual are aligned to a refere...
138
click to vote
BMCBI
2011
14 years 6 months ago
2011
Background: Next-generation sequencing (NGS) offers a unique opportunity for high-throughput genomics and has potential to replace Sanger sequencing in many fields, including de-n...
125
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...