Sciweavers

1074 search results - page 85 / 215
» Parallelizing post-placement timing optimization
Sort
View
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
14 years 9 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
14 years 3 months ago
Parallel Distributed Processing of Constrained Skyline Queries by Filtering
— Skyline queries are capable of retrieving interesting points from a large data set according to multiple criteria. Most work on skyline queries so far has assumed a centralized...
Bin Cui, Hua Lu, Quanqing Xu, Lijiang Chen, Yafei ...
ICPADS
2005
IEEE
14 years 2 months ago
PRec-I-DCM3: A Parallel Framework for Fast and Accurate Large Scale Phylogeny Reconstruction
: Accurate reconstruction of phylogenetic trees very often involves solving hard optimization problems, particularly the maximum parsimony (MP) and maximum likelihood (ML) problems...
Cristian Coarfa, Yuri Dotsenko, John M. Mellor-Cru...
GECCO
2005
Springer
101views Optimization» more  GECCO 2005»
14 years 2 months ago
A scalable parallel genetic algorithm for x-ray spectroscopic analysis
We use a parallel multi-objective genetic algorithm to drive a search and reconstruction spectroscopic analysis of plasma gradients in inertial confinement fusion (ICF) implosion...
Kai Xu, Sushil J. Louis, Roberto C. Mancini
IEEEPACT
1999
IEEE
14 years 1 months ago
Predicated Static Single Assignment
Increases in instruction level parallelism are needed to exploit the potential parallelism available in future wide issue architectures. Predicated execution is an architectural m...
Lori Carter, Beth Simon, Brad Calder, Larry Carter...