Sciweavers

11168 search results - page 130 / 2234
» Abstract State Processes
Sort
View
ECML
2007
Springer
15 years 8 months ago
Efficient Continuous-Time Reinforcement Learning with Adaptive State Graphs
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
Gerhard Neumann, Michael Pfeiffer, Wolfgang Maass
FORMATS
2008
Springer
15 years 6 months ago
Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph
Abstract. In this paper, we propose a new framework for the parametric verification of time Petri nets with stopwatches controlled by inhibitor arcs. We first introduce an extensio...
Louis-Marie Traonouez, Didier Lime, Olivier H. Rou...
CCR
2006
117views more  CCR 2006»
15 years 4 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
SAC
2006
ACM
15 years 4 months ago
Transformation of B specifications into UML class diagrams and state machines
We propose a rule-based approach for transforming B abstract machines into UML diagrams. We believe that important insight into the structure underlying a B model can be gained by...
Houda Fekih, Leila Jemni Ben Ayed, Stephan Merz
CP
2010
Springer
15 years 3 months ago
Computing the Density of States of Boolean Formulas
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
Stefano Ermon, Carla P. Gomes, Bart Selman