406 search results - page 25 / 82 » Boosting Using Branching Programs |
187
Voted
CP
2009
Springer
16 years 1 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
ICFP
2007
ACM
16 years 11 days ago
2007
ACM
In the light of evidence that Haskell programs compiled by GHC exhibit large numbers of mispredicted branches on modern processors, we re-examine the "tagless" aspect of...
203
Voted
AADEBUG
2005
Springer
15 years 6 months ago
2005
Springer
Code coverage analysis, the process of finding code exercised by a particular set of test inputs, is an important component of software development and verification. Most tradit...
AAAI
1997
15 years 1 months ago
1997
We present a theory of qualitative rigid body mechanics and describe a program that uses this theory to compute qualitative dynamic simulations.1 The program works directly from a...
95
Voted
ISCA
1999
IEEE
15 years 4 months ago
1999
IEEE
Modern compilers must expose sufficient amounts of Instruction-Level Parallelism (ILP) to achieve the promised performance increases of superscalar and VLIW processors. One of the...