5169 search results - page 392 / 1034 » Locality approximation using time |
231
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
167
click to vote
DATE
2003
IEEE
16 years 4 days ago
2003
IEEE
The widening gap between processor and memory speeds renders data locality optimization a very important issue in data-intensive embedded applications. Throughout the years hardwa...
174
Voted
AAAI
2000
15 years 8 months ago
2000
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
180
click to vote
VLDB
1987
ACM
15 years 10 months ago
1987
ACM
This paper reports on an implementation of Bayer's Time Interval concurrency control method and compares it to the performance of a conventional timestamp method. The impleme...
212
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...