Sciweavers

666 search results - page 50 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
JCSS
2010
114views more  JCSS 2010»
13 years 7 months ago
FPT algorithms and kernels for the Directed k-Leaf problem
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero ar...
Jean Daligault, Gregory Gutin, Eun Jung Kim, Ander...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 1 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
ICRA
2010
IEEE
172views Robotics» more  ICRA 2010»
13 years 7 months ago
Coordinated multi-robot real-time exploration with connectivity and bandwidth awareness
— While there has been substantial progress for multi-robot exploration of an unknown area, little attention has been given to communication, especially bandwidth constraints in ...
Yuanteng Pei, Matt W. Mutka, Ning Xi
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
14 years 6 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
14 years 2 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