Sciweavers

64 search results - page 4 / 13
» Reducing the Size of NFAs by Using Equivalences and Preorder...
Sort
View
AAAI
1997
13 years 7 months ago
Model Minimization in Markov Decision Processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
Thomas Dean, Robert Givan
ICDE
2003
IEEE
209views Database» more  ICDE 2003»
14 years 7 months ago
An Evaluation of Regular Path Expressions with Qualifiers against XML Streams
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
Dan Olteanu, François Bry, Tobias Kiesling
EUROSYS
2011
ACM
12 years 9 months ago
Symbolic crosschecking of floating-point and SIMD code
We present an effective technique for crosschecking an IEEE 754 floating-point program and its SIMD-vectorized version, implemented in KLEE-FP, an extension to the KLEE symbolic ...
Peter Collingbourne, Cristian Cadar, Paul H. J. Ke...
ICCD
2005
IEEE
124views Hardware» more  ICCD 2005»
13 years 11 months ago
Model Checking C Programs Using F-SOFT
— With the success of formal verification techniques like equivalence checking and model checking for hardware designs, there has been growing interest in applying such techniqu...
Franjo Ivancic, Ilya Shlyakhter, Aarti Gupta, Mala...
AICOM
2004
92views more  AICOM 2004»
13 years 5 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu