4679 search results - page 90 / 936 » Modeling When Connections Are the Problem |
126
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
— Environments with varying reward contingencies constitute a challenge to many living creatures. In such conditions, animals capable of adaptation and learning derive an advanta...
102
click to vote
WSC
2001
15 years 3 months ago
2001
In this paper we present an algorithm for simulating functions of the minimum and terminal value for a random walk with Gaussian increments. These expectations arise in connection...
125
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—Underwater mobile acoustic sensor networks are promising tools for the exploration of the oceans. These networks require new robust solutions for fundamental issues such as: loc...