14165 search results - page 55 / 2833 » The generalized two-server problem |
188
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
157
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder...
143
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Modeling the behavior of imperfect agents from a small number of observations is a difficult, but important task. In the singleagent decision-theoretic setting, inverse optimal co...
145
click to vote
SAC
2011
ACM
14 years 4 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
122
click to vote
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...