Sciweavers

206 search results - page 12 / 42
» Probabilistic Analysis of Large Finite State Machines
Sort
View
ICML
2005
IEEE
16 years 15 days ago
Finite time bounds for sampling based fitted value iteration
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
Csaba Szepesvári, Rémi Munos
CN
2004
89views more  CN 2004»
14 years 11 months ago
On the testability of SDL specifications
The problem of testing from an SDL specification is often complicated by the presence of infeasible paths. This paper introduces an approach for transforming a class of SDL specif...
Robert M. Hierons, T.-H. Kim, Hasan Ural
KESAMSTA
2011
Springer
14 years 2 months ago
Extending the JADE Agent Behaviour Model with JBehaviourTrees Framework
Creating modular behaviours in JADE using a traditional method such as the FSM (Finite State Machine) can be a difficult task to achieve. The first issue with FSMs is that they do...
Iva Bojic, Tomislav Lipic, Mario Kusek, Gordan Jez...
BIOINFORMATICS
2005
152views more  BIOINFORMATICS 2005»
14 years 11 months ago
Intervention in context-sensitive probabilistic Boolean networks
Motivation: Intervention in a gene regulatory network is used to help it avoid undesirable states, such as those associated with a disease. Several types of intervention have been...
Ranadip Pal, Aniruddha Datta, Michael L. Bittner, ...
INFOCOM
1995
IEEE
15 years 3 months ago
Automatic Alarm Correlation for Fault Identification
In communication networks, a large number of alarms exist to signal any abnormal behavior of the network. As network faults typically result in a number of alarms, correlating the...
Isabelle Rouvellou, George W. Hart