665 search results - page 124 / 133 » The Theory of Hybrid Automata |
102
click to vote
ATAL
2011
Springer
13 years 11 months ago
2011
Springer
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...
SIGSOFT
2007
ACM
16 years 13 days ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
CAV
2009
Springer
16 years 7 days ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
101
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
This paper presents a framework for describing the spatial distribution and the global frequency of agents who play the spatial prisoner’s dilemma with coalition formation. The ...