3455 search results - page 490 / 691 » Generalized Game Trees |
159
click to vote
ICML
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper presents an approach to automatic discovery of functions in Genetic Programming. The approach is based on discovery of useful building blocks by analyzing the evolution...
161
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
174
click to vote
DGCI
2009
Springer
15 years 9 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
154
click to vote
ISMB
2007
15 years 9 months ago
2007
Autopolyploidization and allopolyploidization events multiply the number of chromosomes and genomic content. Genome rearrangement phylogenetics requires that all genomes analyzed ...
184
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...