5448 search results - page 375 / 1090 » Breakpoints and Time in Distributed Computations |
169
Voted
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
149
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
218
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
151
click to vote
VLSID
2005
IEEE
16 years 7 months ago
2005
IEEE
Timing margin (slack) needs to be carefully managed to ensure a satisfactory timing yield. We propose a new design flow that combines a false-path-aware gate sizing and a statisti...
195
click to vote
TOG
2012
13 years 9 months ago
2012
Humans have used sketching to depict our visual world since prehistoric times. Even today, sketching is possibly the only rendering technique readily available to all humans. This...