Sciweavers

3569 search results - page 628 / 714
» On the Evolution of Evolutionary Algorithms
Sort
View
COCOON
2005
Springer
15 years 3 months ago
Perfect Sorting by Reversals
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
Marie-France Sagot, Eric Tannier
66
Voted
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 3 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
3DIM
2003
IEEE
15 years 3 months ago
Silhouette and Stereo Fusion for 3D Object Modeling
In this paper, we present a new approach to high quality 3D object reconstruction. Starting from a calibrated sequence of color images, the algorithm is able to reconstruct both t...
Carlos Hernández Esteban, Francis Schmitt
GECCO
2010
Springer
212views Optimization» more  GECCO 2010»
15 years 2 months ago
Generative and developmental systems
This paper argues that multiagent learning is a potential “killer application” for generative and developmental systems (GDS) because key challenges in learning to coordinate ...
Kenneth O. Stanley
GECCO
2009
Springer
15 years 2 months ago
NEAT in increasingly non-linear control situations
Evolution of neural networks, as implemented in NEAT, has proven itself successful on a variety of low-level control problems such as pole balancing and vehicle control. Nonethele...
Matthias J. Linhardt, Martin V. Butz