Sciweavers

312 search results - page 47 / 63
» Learning Partially Observable Deterministic Action Models
Sort
View
ATAL
2011
Springer
12 years 7 months ago
Game theory-based opponent modeling in large imperfect-information games
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
Sam Ganzfried, Tuomas Sandholm
IJCAI
2001
13 years 9 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
NIPS
2003
13 years 9 months ago
A Nonlinear Predictive State Representation
Predictive state representations (PSRs) use predictions of a set of tests to represent the state of controlled dynamical systems. One reason why this representation is exciting as...
Matthew R. Rudary, Satinder P. Singh
ICGI
2010
Springer
13 years 6 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
AINA
2007
IEEE
13 years 7 months ago
Detecting Anomaly Node Behavior in Wireless Sensor Networks
Wireless sensor networks are usually deployed in a way “once deployed, never changed”. The actions of sensor nodes are either pre-scheduled inside chips or triggered to respon...
Qinghua Wang, Tingting Zhang