Sciweavers

476 search results - page 69 / 96
» Representation dependence testing using program inversion
Sort
View
LCTRTS
2007
Springer
14 years 1 months ago
Addressing instruction fetch bottlenecks by using an instruction register file
The Instruction Register File (IRF) is an architectural extension for providing improved access to frequently occurring instructions. An optimizing compiler can exploit an IRF by ...
Stephen Roderick Hines, Gary S. Tyson, David B. Wh...
WCE
2007
13 years 8 months ago
Scenario Generation Employing Copulas
—Multistage stochastic programs are effective for solving long-term planning problems under uncertainty. Such programs are usually based on scenario generation model about future...
Kristina Sutiene, Henrikas Pranevicius
ISMB
1998
13 years 9 months ago
Sequence Assembly Validation by Multiple Restriction Digest Fragment Coverage Analysis
DNA sequence analysis depends on the accurate assembly of fragment reads for the determination of a consensus sequence. This report examines the possibility of analyzing multiple,...
Eric C. Rouchka, David J. States
LCPC
2005
Springer
14 years 1 months ago
Interprocedural Symbolic Range Propagation for Optimizing Compilers
Abstract. We have designed and implemented an interprocedural algorithm to analyze symbolic value ranges that can be assumed by variables at any given point in a program. Our algor...
Hansang Bae, Rudolf Eigenmann
ISPAN
1997
IEEE
13 years 12 months ago
A method for estimating optimal unrolling times for nested loops
Loop unrolling is one of the most promising parallelization techniques, because the nature of programs causes most of the processing time to be spent in their loops. Unrolling not...
Akira Koseki, Hideaki Komatsu, Yoshiaki Fukazawa