3268 search results - page 416 / 654 » The hub number of a graph |
139
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
171
click to vote
VLSID
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
138
click to vote
CIKM
1999
Springer
15 years 11 months ago
1999
Springer
The join relational operation is one of the most expensive among database operations. In this study, we consider the problem of scheduling page accesses in join processing. This r...
175
click to vote
ISLPED
1996
ACM
15 years 10 months ago
1996
ACM
We present a dynamic programming technique for solving the multiple supply voltage scheduling problem in both nonpipelined and functionally pipelined data-paths. The scheduling pro...
156
click to vote
COMPGEOM
1990
ACM
15 years 10 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...