Sciweavers

4860 search results - page 639 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ICPPW
2005
IEEE
16 years 7 days ago
Factoring Solution Sets of Polynomial Systems in Parallel
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
Anton Leykin, Jan Verschelde
WIOPT
2005
IEEE
16 years 7 days ago
Iterated Local Optimization for Minimum Energy Broadcast
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...
Intae Kang, Radha Poovendran
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
16 years 6 days ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
16 years 5 days ago
Measuring, enabling and comparing modularity, regularity and hierarchy in evolutionary design
For computer-automated design systems to scale to complex designs they must be able to produce designs that exhibit the characteristics of modularity, regularity and hierarchy –...
Gregory Hornby
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
16 years 4 days ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...