Sciweavers

406 search results - page 26 / 82
» Boosting Using Branching Programs
Sort
View
POPL
2003
ACM
14 years 11 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
ISCA
1998
IEEE
108views Hardware» more  ISCA 1998»
14 years 3 months ago
Pipeline Gating: Speculation Control for Energy Reduction
Branch prediction has enabled microprocessors to increase instruction level parallelism (ILP) by allowing programs to speculatively execute beyond control boundaries. Although spe...
Srilatha Manne, Artur Klauser, Dirk Grunwald
ISSS
1996
IEEE
103views Hardware» more  ISSS 1996»
14 years 3 months ago
Instruction Set Design and Optimizations for Address Computation in DSP Architectures
In this paper we investigate the problem of code generation for address computation for DSP processors. This work is divided into four parts. First, we propose a branch instructio...
Guido Araujo, Ashok Sudarsanam, Sharad Malik
ACG
2006
Springer
14 years 2 months ago
Enhancing Search Efficiency by Using Move Categorization Based on Game Progress in Amazons
Amazons is a two-player perfect information game with a high branching factor, particularly in the opening. Therefore, improving the efficiency of the search is important for impro...
Yoshinori Higashiuchi, Reijer Grimbergen
KBSE
2008
IEEE
14 years 5 months ago
DiffGen: Automated Regression Unit-Test Generation
— Software programs continue to evolve throughout their lifetime. Maintenance of such evolving programs, including regression testing, is one of the most expensive activities in ...
Kunal Taneja, Tao Xie