Sciweavers

1382 search results - page 128 / 277
» Formal Analysis of Online Algorithms
Sort
View
DAC
2004
ACM
16 years 7 months ago
The best of both worlds: the efficient asynchronous implementation of synchronous specifications
The desynchronization approach combines a traditional synchronous specification style with a robust asynchronous implementation model. The main contribution of this paper is the d...
Abhijit Davare, Kelvin Lwin, Alex Kondratyev, Albe...
IJCAI
2007
15 years 7 months ago
Average-Reward Decentralized Markov Decision Processes
Formal analysis of decentralized decision making has become a thriving research area in recent years, producing a number of multi-agent extensions of Markov decision processes. Wh...
Marek Petrik, Shlomo Zilberstein
SIGMETRICS
2008
ACM
130views Hardware» more  SIGMETRICS 2008»
15 years 6 months ago
Using probabilistic model checking in systems biology
Probabilistic model checking is a formal verification framework for systems which exhibit stochastic behaviour. It has been successfully applied to a wide range of domains, includ...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
DOCENG
2010
ACM
15 years 3 months ago
Diffing, patching and merging XML documents: toward a generic calculus of editing deltas
This work addresses what we believe to be a central issue in the field of XML diff and merge computation: the mathematical modeling o-called editing deltas and the study of their ...
Jean-Yves Vion-Dury
BMCBI
2010
123views more  BMCBI 2010»
15 years 6 months ago
Decoding HMMs using the k best paths: algorithms and applications
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
Daniel G. Brown 0001, Daniil Golod