1982 search results - page 262 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
157
Voted
FIDJI
2003
Springer
15 years 8 months ago
2003
Springer
The popular slogan ”write once, run anywhere” effectively renders the expressive capabilities of the Java programming framework for developing, deploying, and reusing target-i...
132
click to vote
CONEXT
2010
ACM
15 years 1 months ago
2010
ACM
Peer-to-peer has emerged in recent years as a promising approach to providing Video-on-Demand streaming. The design space, however, is vast and still not well understood--yet choo...
120
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
172
click to vote
ICDCS
1996
IEEE
15 years 7 months ago
1996
IEEE
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
100
click to vote
DAC
2007
ACM
16 years 4 months ago
2007
ACM
In this paper we address the the growing issue of junction tunneling leakage (Ijunc) at the circuit level. Specifically, we develop a fast approach to analyze the state-dependent ...