Sciweavers

441 search results - page 30 / 89
» A Method for Proving Observational Equivalence
Sort
View
FORMATS
2009
Springer
14 years 22 days ago
Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
Peter Bulychev, Thomas Chatain, Alexandre David, K...
JOC
2008
86views more  JOC 2008»
13 years 8 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
BMCBI
2008
97views more  BMCBI 2008»
13 years 9 months ago
SiteSeek: Post-translational modification analysis using adaptive locality-effective kernel methods and new profiles
Background: Post-translational modifications have a substantial influence on the structure and functions of protein. Post-translational phosphorylation is one of the most common m...
Paul D. Yoo, Yung Shwen Ho, Bing Bing Zhou, Albert...
IOR
2008
91views more  IOR 2008»
13 years 8 months ago
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in the chain can be random an...
Pierre L'Ecuyer, Christian Lécot, Bruno Tuf...
ATAL
2007
Springer
14 years 3 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker