1167 search results - page 156 / 234 » Relational Markov Games |
EURONGI
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
SSPR
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. It is difficult to track, parse and model human-computer interactions during editing and revising of documents, but it is necessary if we are to develop automated technol...
DSD
2002
IEEE
14 years 3 months ago
2002
IEEE
In this paper we introduce concepts of a potential fault latency and a real fault latency for Finite State Machines (FSMs). The potential latency defines a minimal value of the po...
WACV
2002
IEEE
14 years 2 months ago
2002
IEEE
In this paper a range synthesis algorithm is proposed as an initial solution to the problem of 3D environment modeling from sparse data. We develop a statistical learning method f...
ICML
2000
IEEE
14 years 2 months ago
2000
IEEE
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...