Sciweavers

275 search results - page 15 / 55
» A Markovian Concurrency Measure
Sort
View
SOFSEM
2007
Springer
15 years 3 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger
PLDI
2006
ACM
15 years 3 months ago
The Compressor: concurrent, incremental, and parallel compaction
The widely used Mark-and-Sweep garbage collector has a drawback in that it does not move objects during collection. As a result, large long-running realistic applications, such as...
Haim Kermany, Erez Petrank
SPIN
2010
Springer
14 years 8 months ago
Context-Bounded Translations for Concurrent Software: An Empirical Evaluation
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
Naghmeh Ghafari, Alan J. Hu, Zvonimir Rakamaric
CORR
2006
Springer
86views Education» more  CORR 2006»
14 years 9 months ago
Optimal Distortion-Power Tradeoffs in Sensor Networks: Gauss-Markov Random Processes
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...
Nan Liu, Sennur Ulukus
IOR
2006
163views more  IOR 2006»
14 years 9 months ago
Adaptive Importance Sampling Technique for Markov Chains Using Stochastic Approximation
For a discrete-time finite-state Markov chain, we develop an adaptive importance sampling scheme to estimate the expected total cost before hitting a set of terminal states. This s...
T. P. I. Ahamed, Vivek S. Borkar, S. Juneja