Sciweavers

291 search results - page 15 / 59
» Implementation with a bounded action space
Sort
View
ENTCS
2006
137views more  ENTCS 2006»
13 years 8 months ago
An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
Morgan Magnin, Didier Lime, Olivier H. Roux
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
14 years 3 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
UAI
2000
13 years 10 months ago
PEGASUS: A policy search method for large MDPs and POMDPs
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
Andrew Y. Ng, Michael I. Jordan
ASE
2004
167views more  ASE 2004»
13 years 8 months ago
Cluster-Based Partial-Order Reduction
The verification of concurrent systems through an exhaustive traversal of the state space suffers from the infamous state-space-explosion problem, caused by the many interleavings ...
Twan Basten, Dragan Bosnacki, Marc Geilen
JCP
2008
139views more  JCP 2008»
13 years 8 months ago
Agent Learning in Relational Domains based on Logical MDPs with Negation
In this paper, we propose a model named Logical Markov Decision Processes with Negation for Relational Reinforcement Learning for applying Reinforcement Learning algorithms on the ...
Song Zhiwei, Chen Xiaoping, Cong Shuang