1167 search results - page 111 / 234 » Relational Markov Games |
167
click to vote
DM
2010
15 years 5 months ago
2010
This paper solves the Knights and Spies Problem: In a room there are n people, each labelled with a unique number between 1 and n. A person may either be a knight or a spy. Knights...
155
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Surface registration is a fundamental step in the reconstruction of three-dimensional objects. This is typically a two step process where an initial coarse motion estimation is fo...
170
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
168
click to vote
QEST
2005
IEEE
15 years 11 months ago
2005
IEEE
iLTL is a probabilistic temporal logic that can specify properties of multiple discrete time Markov chains (DTMCs). In this paper, we describe two related tools: MarkovEstimator a...
287
click to vote
Book
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...