Sciweavers

666 search results - page 37 / 134
» Inspector Methods for State Abstraction
Sort
View

Publication
222views
15 years 6 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
ASYNC
2004
IEEE
98views Hardware» more  ASYNC 2004»
15 years 1 months ago
Synthesis of Speed Independent Circuits Based on Decomposition
This paper presents a decomposition method for speedindependent circuit design that is capable of significantly reducing the cost of synthesis. In particular, this method synthesi...
Tomohiro Yoneda, Hiroomi Onda, Chris J. Myers
CADE
2008
Springer
15 years 10 months ago
Towards SMT Model Checking of Array-Based Systems
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
ECAI
2004
Springer
15 years 3 months ago
Compilation of LTL Goal Formulas into PDDL
Abstract. Temporally extended goals are used in planning to express safety and maintenance conditions. Linear temporal logic is the language often used to express temporally extend...
Stephen Cresswell, Alexandra M. Coddington
FORMATS
2004
Springer
15 years 3 months ago
Symbolic Model Checking for Simply-Timed Systems
Abstract. We describe OBDD-based symbolic model checking algorithms for simply-timed systems, i.e. finite state graphs where transitions carry a duration. These durations can be a...
Nicolas Markey, Ph. Schnoebelen