2796 search results - page 478 / 560 » The coolest path problem |
123
click to vote
PLDI
1999
ACM
15 years 9 months ago
1999
ACM
Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the re...
138
click to vote
HICSS
1999
IEEE
15 years 9 months ago
1999
IEEE
As access to hypermedia documents becomes generally available, it becomes increasingly important to understand how casual users search for information. We have studied search patt...
175
click to vote
ICCAD
1999
IEEE
15 years 9 months ago
1999
IEEE
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
156
click to vote
VISUALIZATION
1999
IEEE
15 years 9 months ago
1999
IEEE
ct A method for comparing three-dimensional vector fields constructed from simple critical points is described. This method is a natural extension of the previous work [1] which de...
127
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...