411 search results - page 61 / 83 » Distributed algorithms for QoS load balancing |
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—Designing a sensor network congestion avoidance algorithm is a challenging task due to the application specific nature of these networks. The frequency of event sensing is a de...
ICPPW
2006
IEEE
14 years 1 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
Abstract-- Sensor networks are typically unattended because of their deployment in hazardous, hostile or remote environments. This makes the problem of conserving energy at individ...
PODC
1999
ACM
13 years 11 months ago
1999
ACM
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...