1840 search results - page 142 / 368 » time 2002 |
155
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
138
click to vote
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
With device counts on modern-day ASICs crossing the 10 million mark, careful planning of an ASIC design project is necessary to meet time deadlines. Two problems arise in this con...
119
click to vote
ISSS
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we introduce a Round–robin Arbiter Generator (RAG) tool. The RAG tool can generate a design for a Bus Arbiter (BA). The BA is able to handle the exact number of b...
118
click to vote
RTSS
2002
IEEE
15 years 9 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
121
click to vote
ALGORITHMICA
2002
15 years 4 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...