Sciweavers

1350 search results - page 143 / 270
» Reasoning about Staged Computation
Sort
View
AINA
2010
IEEE
15 years 10 months ago
Active Data Selection for Sensor Networks with Faults and Changepoints
Abstract—We describe a Bayesian formalism for the intelligent selection of observations from sensor networks that may intermittently undergo faults or changepoints. Such active d...
Michael A. Osborne, Roman Garnett, Stephen J. Robe...
CONCUR
2000
Springer
15 years 9 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
PODC
2010
ACM
15 years 9 months ago
Verifying linearizability with hindsight
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...
158
Voted
ACMICEC
2006
ACM
111views ECommerce» more  ACMICEC 2006»
15 years 9 months ago
Passive verification of the strategyproofness of mechanisms in open environments
Consider an open infrastructure in which anyone can deploy mechanisms to support automated decision making and coordination amongst self-interested computational agents. Strategyp...
Laura Kang, David C. Parkes
ISMB
1993
15 years 6 months ago
Protein Sequencing Experiment Planning Using Analogy
Experiment design and execution is a central activity in the natural sciences. The SeqERsystem provides a general architecture for the integration of automated planning techniques...
Brian P. Kettler, Lindley Darden