628 search results - page 115 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
100
click to vote
GECCO
2008
Springer
15 years 24 days ago
2008
Springer
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
114
click to vote
PAMI
2006
14 years 11 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
100
click to vote
DC
2010
14 years 11 months ago
2010
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
RECOMB
2006
Springer
16 years 16 hour ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...