Sciweavers

1099 search results - page 126 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
COCO
2007
Springer
87views Algorithms» more  COCO 2007»
15 years 4 months ago
Parity Problems in Planar Graphs
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
DAC
2006
ACM
15 years 11 months ago
Optimal jumper insertion for antenna avoidance under ratio upper-bound
Antenna effect may damage gate oxides during plasma-based fabrication process. The antenna ratio of total exposed antenna area to total gate oxide area is directly related to the ...
Jia Wang, Hai Zhou
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
15 years 2 months ago
On the Multiple Gene Duplication Problem
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
Michael R. Fellows, Michael T. Hallett, Ulrike Ste...
GECCO
2009
Springer
157views Optimization» more  GECCO 2009»
15 years 4 months ago
Multi material topological optimization of structures and mechanisms
Multi-material 3D-printing technologies permit the freeform fabrication of complex spatial arrangements of materials in arbitrary geometries. This technology has opened the door t...
Jonathan D. Hiller, Hod Lipson
CEC
2011
IEEE
13 years 10 months ago
Trainer selection strategies for coevolving rank predictors
—Despite the range of applications and successes of evolutionary algorithms, expensive fitness computations often form a critical performance bottleneck. A preferred method of r...
Daniel L. Ly, Hod Lipson