2924 search results - page 301 / 585 » Lower Bounds in Distributed Computing |
164
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
182
click to vote
GD
2001
Springer
15 years 11 months ago
2001
Springer
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
171
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
167
click to vote
ISPD
1997
ACM
15 years 10 months ago
1997
ACM
We present results which show that a separate global and detailed routing strategy can be competitive with a combined routing process. Under restricted architectural assumptions, ...
191
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
Abstract -- This paper introduces a new HW/SW partitioning algorithm used in automating the instruction set processor design for pipelined ASIP (Application Specific Integrated Pro...