5606 search results - page 858 / 1122 » Randomization Techniques for Graphs. |
167
click to vote
SLIP
2003
ACM
15 years 12 months ago
2003
ACM
In the past, a priori interconnect prediction, based on Rent’s rule, has been applied mainly for technology evaluation and roadmap applications. These applications do not requir...
199
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
167
click to vote
IEEEPACT
2002
IEEE
15 years 11 months ago
2002
IEEE
Java exception checks are designed to ensure that any faulting instruction causing a hardware exception does not terminate the program abnormally. These checks, however, impose so...
163
click to vote
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
195
click to vote
ASPLOS
1998
ACM
15 years 11 months ago
1998
ACM
As the gap between memory and processor speeds continues to widen, cache efficiency is an increasingly important component of processor performance. Compiler techniques have been...