Sciweavers

229 search results - page 38 / 46
» Bilateral Algorithms for Symbolic Abstraction
Sort
View
AIPS
2008
13 years 10 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
FORTE
2003
13 years 9 months ago
Generation of All Counter-Examples for Push-Down Systems
We present a new, on-the-fly algorithm that given a push-down model representing a sequential program with (recursive) procedure calls and an extended finite-state automaton repr...
Samik Basu, Diptikalyan Saha, Yow-Jian Lin, Scott ...
TIT
2008
74views more  TIT 2008»
13 years 7 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf
CAV
2009
Springer
239views Hardware» more  CAV 2009»
13 years 11 months ago
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
tic modalities for correctness [16]. The release described in this abstract is a complete rebuild of a preliminary experimental checker [14]. The model input language includes vari...
Alessio Lomuscio, Hongyang Qu, Franco Raimondi
MVA
1990
123views Computer Vision» more  MVA 1990»
13 years 8 months ago
Randomized Hough Transform (RHT) in Engineering Drawing Vectorization System
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
Pekka Kultanen, Erkki Oja, Lei Xu