1548 search results - page 221 / 310 » Optimization Services: A Framework for Distributed Optimizat... |
126
click to vote
PE
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we present a new approach to derive heavy-traffic asymptotics for polling models. We consider the classical cyclic polling model with exhaustive or gated service at ...
151
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—In wireless networks, how to select transmit power that maximizes throughput is a challenging problem. On one hand, transmissions at a high power level could increase interferen...
162
click to vote
SPAA
2009
ACM
16 years 2 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
142
click to vote
ATAL
2004
Springer
15 years 10 months ago
2004
Springer
This paper proposes a new multiagent planning approach to coordination synthesis that views distributed agents as discrete-event processes. The connection between discreteevent co...
154
click to vote
CLUSTER
2006
IEEE
15 years 5 months ago
2006
IEEE
Application scheduling plays an important role in high-performance cluster computing. Application scheduling can be classified as job scheduling and task scheduling. This paper pre...