Sciweavers

945 search results - page 179 / 189
» Incremental Branching Programs
Sort
View
IEEEPACT
2000
IEEE
14 years 17 hour ago
A Lightweight Algorithm for Dynamic If-Conversion during Dynamic Optimization
Dynamic Optimization is an umbrella term that refers to any optimization of software that is performed after the initial compile time. It is a complementary optimization opportuni...
Kim M. Hazelwood, Thomas M. Conte
AB
2007
Springer
13 years 11 months ago
Efficient Haplotype Inference with Pseudo-boolean Optimization
Abstract. Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible ...
Ana Graça, João Marques-Silva, In&ec...
ELPUB
2007
ACM
13 years 11 months ago
Multimedia Modular Training Packages by EUAIN
The European Accessible Information Network (EUAIN) was established to support the move to incorporate accessibility within mainstream content processing environments. EUAIN has b...
David Crombie, George T. Ioannidis, Neil McKenzie
CASES
2006
ACM
13 years 11 months ago
Reaching fast code faster: using modeling for efficient software thread integration on a VLIW DSP
When integrating software threads together to boost performance on a processor with instruction-level parallel processing support, it is rarely clear which code regions should be ...
Won So, Alexander G. Dean
ISCA
1995
IEEE
92views Hardware» more  ISCA 1995»
13 years 11 months ago
A Comparison of Full and Partial Predicated Execution Support for ILP Processors
One can e ectively utilize predicated execution to improve branch handling in instruction-level parallel processors. Although the potential bene ts of predicated execution are hig...
Scott A. Mahlke, Richard E. Hank, James E. McCormi...