Sciweavers

206 search results - page 21 / 42
» Probabilistic Analysis of Large Finite State Machines
Sort
View
HPCA
2003
IEEE
16 years 2 days ago
Tradeoffs in Buffering Memory State for Thread-Level Speculation in Multiprocessors
Thread-level speculation provides architectural support to aggressively run hard-to-analyze code in parallel. As speculative tasks run concurrently, they generate unsafe or specul...
María Jesús Garzarán, Milos P...
ICML
2006
IEEE
16 years 15 days ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan
BMCBI
2007
173views more  BMCBI 2007»
14 years 11 months ago
Predicting state transitions in the transcriptome and metabolome using a linear dynamical system model
Background: Modelling of time series data should not be an approximation of input data profiles, but rather be able to detect and evaluate dynamical changes in the time series dat...
Ryoko Morioka, Shigehiko Kanaya, Masami Y. Hirai, ...
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 4 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
FMCAD
2004
Springer
15 years 3 months ago
Bloom Filters in Probabilistic Verification
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
Peter C. Dillinger, Panagiotis Manolios