1912 search results - page 138 / 383 » Optimizing interconnection policies |
141
Voted
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
—We consider opportunistic communications over multiple channels where the state (“good” or “bad”) of each channel evolves as independent and identically distributed Mark...
120
Voted
EENERGY
2010
15 years 7 months ago
2010
Sleeping is an important method to reduce energy consumption in many information and communication systems. In this paper we focus on a typical server under dynamic load, where en...
143
Voted
INFOCOM
1995
IEEE
15 years 7 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
133
Voted
AAMAS
2010
Springer
15 years 3 months ago
2010
Springer
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
124
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...