Sciweavers

551 search results - page 80 / 111
» The Complexity of Andersen's Analysis in Practice
Sort
View
IPPS
2006
IEEE
14 years 2 months ago
Parallelization and performance characterization of protein 3D structure prediction of Rosetta
The prediction of protein 3D structure has become a hot research area in the post-genome era, through which people can understand a protein’s function in health and disease, exp...
Wenlong Li, Tao Wang, Eric Li, D. Baker, Li Jin, S...
MOBICOM
2006
ACM
14 years 2 months ago
Localization in sparse networks using sweeps
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density h...
David Kiyoshi Goldenberg, Pascal Bihler, Yang Rich...
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
14 years 1 months ago
Evolving Better Multiple Sequence Alignments
Aligning multiple DNA or protein sequences is a fundamental step in the analyses of phylogeny, homology and molecular structure. Heuristic algorithms are applied because optimal mu...
Luke Sheneman, James A. Foster
DATE
2003
IEEE
128views Hardware» more  DATE 2003»
14 years 1 months ago
Flexible and Formal Modeling of Microprocessors with Application to Retargetable Simulation
Given the growth in application-specific processors, there is a strong need for a retargetable modeling framework that is capable of accurately capturing complex processor behavi...
Wei Qin, Sharad Malik
GLVLSI
2003
IEEE
153views VLSI» more  GLVLSI 2003»
14 years 1 months ago
FORCE: a fast and easy-to-implement variable-ordering heuristic
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah