Sciweavers

4488 search results - page 264 / 898
» Properties of NP-Complete Sets
Sort
View
PODC
2003
ACM
16 years 23 hour ago
A lattice-theoretic characterization of safety and liveness
The distinction between safety and liveness properties is due to Lamport who gave the following informal characterization. Safety properties assert that nothing bad ever happens w...
Panagiotis Manolios, Richard J. Trefler
185
Voted
ECSQARU
2001
Springer
15 years 11 months ago
Social Choice, Merging, and Elections
Abstract. Intelligent agents have to be able to merge inputs received from different sources in a coherent and rational way. Recently, several proposals have been made for the merg...
Thomas Andreas Meyer, Aditya Ghose, Samir Chopra
ICDCSW
2000
IEEE
15 years 11 months ago
Games-Based Model Checking of Protocols: counting doesn't count
We introduce a technique that can be used to model the behaviour of protocols. In our model each process within a protocol belongs to a particular class. A set of rules governs th...
Tim Kempster, Colin Stirling, Peter Thanisch
CONCUR
1999
Springer
15 years 11 months ago
Robust Satisfaction
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
Orna Kupferman, Moshe Y. Vardi
ISCA
1998
IEEE
144views Hardware» more  ISCA 1998»
15 years 11 months ago
Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism
This paper investigates the placement of data and parity on redundant disk arrays. Declustered organizations have been traditionally used to achieve fast reconstruction of a faile...
Guillermo A. Alvarez, Walter A. Burkhard, Larry J....