14386 search results - page 342 / 2878 » The Chinese Generals Problem |
209
click to vote
CORR
2011
Springer
15 years 1 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...
198
click to vote
CORR
2011
Springer
15 years 1 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...
201
click to vote
SAC
2011
ACM
14 years 9 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 ...
164
click to vote
ICCV
2011
IEEE
14 years 6 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...
194
click to vote
EWSN
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...