406 search results - page 25 / 82 » Boosting Using Branching Programs |
CP
2009
Springer
14 years 9 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
14 years 8 months 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...
AADEBUG
2005
Springer
14 years 2 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
13 years 10 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...
ISCA
1999
IEEE
14 years 24 days 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...