13041 search results - page 2536 / 2609 » Simulating space and time |
125
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
141
click to vote
MDM
2005
Springer
15 years 7 months ago
2005
Springer
Data access prediction has been proposed as a mechanism to overcome latency lag, and more recently as a means of conserving energy in mobile systems. We present a fully adaptive p...
109
click to vote
PPAM
2005
Springer
15 years 7 months ago
2005
Springer
We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed ove...
122
click to vote
VLDB
2005
ACM
15 years 7 months ago
2005
ACM
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
131
click to vote
ASPLOS
2004
ACM
15 years 7 months ago
2004
ACM
This paper introduces a compiler-orchestrated prefetching system as a unified framework geared toward ameliorating the gap between processing speeds and memory access latencies. ...