2694 search results - page 415 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
178
click to vote
MOBIHOC
2005
ACM
16 years 6 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
186
click to vote
DMSN
2004
ACM
15 years 12 months ago
2004
ACM
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
192
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
188
click to vote
HPCC
2007
Springer
16 years 17 days ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
174
click to vote
ICPP
1995
IEEE
15 years 10 months ago
1995
IEEE
—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes a...