Sciweavers

373 search results - page 37 / 75
» Analysis of Recursive State Machines
Sort
View
B
2007
Springer
15 years 4 months ago
Modelling and Proof Analysis of Interrupt Driven Scheduling
Following a brief discussion of uniprocessor scheduling in which we argue the case for formal analysis, we describe a distributed Event B model of interrupt driven scheduling. We ï...
Bill Stoddart, Dominique Cansell, Frank Zeyda
ICML
2006
IEEE
15 years 3 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup
IWRIDL
2006
ACM
141views Education» more  IWRIDL 2006»
15 years 3 months ago
Shallow syntax analysis in Sanskrit guided by semantic nets constraints
We present the state of the art of a computational platform for the analysis of classical Sanskrit. The platform comprises modules for phonology, morphology, segmentation and shal...
Gérard P. Huet
CCA
2005
Springer
15 years 3 months ago
Effectively Open Real Functions
A function f is continuous iff the pre-image f −1[V ] of any open setV is open again. Dual to this topological7 property, f is called open iff the image f [U] of any open set U ...
Martin Ziegler
LICS
2007
IEEE
15 years 4 months ago
First-Order and Temporal Logics for Nested Words
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
Rajeev Alur, Marcelo Arenas, Pablo Barceló,...