Sciweavers

204 search results - page 29 / 41
» Continuations and Concurrency
Sort
View
CONCUR
2008
Springer
13 years 11 months ago
Dynamic Partial Order Reduction Using Probe Sets
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Harmen Kastenberg, Arend Rensink
AIPS
2003
13 years 11 months ago
A Framework for Planning in Continuous-time Stochastic Domains
We propose a framework for policy generation in continuoustime stochastic domains with concurrent actions and events of uncertain duration. We make no assumptions regarding the co...
Håkan L. S. Younes, David J. Musliner, Reid ...
IWMMDBMS
1998
92views more  IWMMDBMS 1998»
13 years 11 months ago
Version Management and Recoverability for Large Object Data
Most applications that access large data objects do so through file systems, but file systems provide an incomplete solution, as they maintain insufficient metadata and do not pro...
Randal C. Burns, Inderpal Narang
WSC
1997
13 years 11 months ago
AutoMod Tutorial
The AutoModTM simulation system differs significantly from other systems because of its ability to deal with the physical elements of a system in physical (graphical) terms and th...
Matthew W. Rohrer
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 10 months ago
On Omega Context Free Languages which are Borel Sets of Infinite Rank
This paper is a continuation of the study of topological properties of omega context free languages (-CFL). We proved in [Topological Properties of Omega Context Free Languages, T...
Olivier Finkel