Sciweavers

928 search results - page 182 / 186
» Evolutionary algorithms and matroid optimization problems
Sort
View
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 1 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
14 years 1 months ago
Resource-limited genetic programming: the dynamic approach
Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources ...
Sara Silva, Ernesto Costa
GECCO
2004
Springer
14 years 1 months ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby
GECCO
2003
Springer
128views Optimization» more  GECCO 2003»
14 years 27 days ago
Cellular Programming and Symmetric Key Cryptography Systems
Abstract. The problem of designing symmetric key cryptography algorithms based upon cellular automata (CAs) is considered. The reliability of the Vernam cipher used in the process ...
Franciszek Seredynski, Pascal Bouvry, Albert Y. Zo...
GCB
2000
Springer
137views Biometrics» more  GCB 2000»
13 years 11 months ago
Detecting Sporadic Recombination in DNA Alignments with Hidden Markov Models
Conventional phylogenetic tree estimation methods assume that all sites in a DNA multiple alignment have the same evolutionary history. This assumption is violated in data sets fro...
Dirk Husmeier, Frank Wright