1277 search results - page 181 / 256 » Terminating Decision Algorithms Optimally |
136
Voted
SIAMJO
2002
15 years 3 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
134
Voted
QUESTA
2010
15 years 2 months ago
2010
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...
146
click to vote
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
129
Voted
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Optimal resource scheduling in multiagent systems is a computationally challenging task, particularly when the values of resources are not additive. We consider the combinatorial ...
138
Voted
JAIR
2006
15 years 3 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...