231 search results - page 22 / 47 » Stochastic Optimization is (Almost) as easy as Deterministic... |
AAAI
2010
13 years 4 months ago
2010
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...
IPCO
2010
13 years 9 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
AAAI
1996
13 years 9 months ago
1996
Agents can benefit from contracting some of their tasks that cannot be performedby themselves or that can be performed moreefficiently by other agents. Developing an agent's ...
NETCOOP
2009
Springer
14 years 2 months ago
2009
Springer
There are moves in the Internet architecture community to add multipath capabilities to TCP, so that end-systems will be able to shift their traffic away from congested parts of th...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider a queueing system with controllable service rate; for example, a transmitter whose rate can be controlled by varying the transmission power. For such a system we ob...