Sciweavers

895 search results - page 93 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
GECCO
2006
Springer
153views Optimization» more  GECCO 2006»
15 years 2 months ago
Analysis of the difficulty of learning goal-scoring behaviour for robot soccer
Learning goal-scoring behaviour from scratch for simulated robot soccer is considered to be a very difficult problem, and is often achieved by endowing players with an innate set ...
Jeff Riley, Victor Ciesielski
WABI
2005
Springer
15 years 4 months ago
Minimum Recombination Histories by Branch and Bound
Recombination plays an important role in creating genetic diversity within species, and inferring past recombination events is central to many problems in genetics. Given a set M o...
Rune B. Lyngsø, Yun S. Song, Jotun Hein
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
15 years 4 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
BMCBI
2008
170views more  BMCBI 2008»
14 years 11 months ago
A genetic approach for building different alphabets for peptide and protein classification
Background: In this paper, it is proposed an optimization approach for producing reduced alphabets for peptide classification, using a Genetic Algorithm. The classification task i...
Loris Nanni, Alessandra Lumini
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 4 days ago
Potential fitness for genetic programming
We introduce potential fitness, a variant of fitness function that operates in the space of schemata and is applicable to tree-based genetic programing. The proposed evaluation ...
Krzysztof Krawiec, PrzemysBaw Polewski