542 search results - page 3 / 109 » Optimal delay scheduling in networks with arbitrary constrai... |
135
click to vote
WIOPT
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
161
click to vote
FOCS
1997
IEEE
15 years 10 months ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
155
click to vote
AAAI
2010
15 years 7 months ago
2010
Security games, and important class of Stackelberg games, are used in deployed decision-support tools in use by LAX police and the Federal Air Marshals Service. The algorithms use...
145
click to vote
IPSN
2005
Springer
15 years 11 months ago
2005
Springer
— Lifetime maximization is one key element in the design of sensor-network-based surveillance applications. We propose a protocol for node sleep scheduling that guarantees a boun...
197
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...