1912 search results - page 220 / 383 » Optimizing interconnection policies |
142
click to vote
JAIR
2006
15 years 4 months ago
2006
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
128
click to vote
JSAC
2006
15 years 4 months ago
2006
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is presented via geometric programming (GP). QPS finds a data ...
158
click to vote
JSAC
2010
15 years 2 months ago
2010
Abstract— Service placement is a key problem in communication networks as it determines how efficiently the user service demands are supported. This problem has been traditional...
142
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...
155
click to vote
ISCC
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....