Sciweavers

88 search results - page 16 / 18
» Reachability in Stochastic Timed Games
Sort
View
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
13 years 9 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
IOR
2002
112views more  IOR 2002»
13 years 7 months ago
Interdisciplinary Meandering in Science
abstract mathematics. My mentor was Professor S. Bochner, a distinguished contributor to harmonic analysis. My classmates included Richard Bellman (who later nurtured the method of...
Samuel Karlin
LMCS
2007
132views more  LMCS 2007»
13 years 7 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
ATAL
2008
Springer
13 years 9 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...
AAAI
2006
13 years 8 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet