945 search results - page 123 / 189 » Incremental Branching Programs |
DNA
2009
Springer
14 years 2 months ago
2009
Springer
Process algebras are widely used for defining the formal semantics of concurrent communicating processes. In process algebra, concurrent processes can be specified to execute di...
ICS
2007
Tsinghua U.
14 years 1 months ago
2007
Tsinghua U.
This paper investigates helper threads that improve performance by prefetching data on behalf of an application’s main thread. The focus is data prefetch helper threads that lac...
COCO
2003
Springer
14 years 1 months ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
IPCCC
1999
IEEE
14 years 2 days ago
1999
IEEE
Performance evaluation of modern, highly speculative, out-of-order microprocessors and the corresponding production of detailed, valid, accurate results have become serious challe...
INFORMS
2010
13 years 6 months ago
2010
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...