Sciweavers

73 search results - page 13 / 15
» Model Checking Action- and State-Labelled Markov Chains
Sort
View
FORMATS
2006
Springer
14 years 2 months ago
Extended Directed Search for Probabilistic Timed Reachability
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
Husain Aljazzar, Stefan Leue
ILP
2007
Springer
14 years 5 months ago
Building Relational World Models for Reinforcement Learning
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
Trevor Walker, Lisa Torrey, Jude W. Shavlik, Richa...
ICMCS
2000
IEEE
98views Multimedia» more  ICMCS 2000»
14 years 3 months ago
Mining User Behavior for Resource Prediction in Interactive Electronic Malls
Applications in virtual multimedia catalogs are highly interactive. Thus, it is difficult to estimate resource demands required for presentation of catalog contents. In this pape...
Silvia Hollfelder, Vincent Oria, M. Tamer Özs...
TGC
2010
Springer
13 years 9 months ago
Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chain...
Marco Bernardo, Rocco De Nicola, Michele Loreti
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
14 years 3 months ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro