Sciweavers

5084 search results - page 343 / 1017
» Proving Possibility Properties
Sort
View
AAIM
2006
Springer
94views Algorithms» more  AAIM 2006»
16 years 21 days ago
Some Basics on Tolerances
In this note we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (Σ, Π, MA...
Boris Goldengorin, Gerold Jäger, Paul Molitor
CSFW
2005
IEEE
16 years 10 days ago
Reconstruction of Attacks against Cryptographic Protocols
We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded ...
Xavier Allamigeon, Bruno Blanchet
CSFW
2005
IEEE
16 years 10 days ago
Temporal Rank Functions for Forward Secrecy
A number of key establishment protocols claim the property of forward secrecy, where the compromise of a longterm key does not result in the compromise of previously computed sess...
Rob Delicata, Steve A. Schneider
ISPDC
2005
IEEE
16 years 9 days ago
A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling ...
Daniel Grosu, Thomas E. Carroll
LICS
2005
IEEE
16 years 9 days ago
Mean-Payoff Parity Games
Games played on graphs may have qualitative objectives, such as the satisfaction of an ω-regular property, or quantitative objectives, such as the optimization of a realvalued re...
Krishnendu Chatterjee, Thomas A. Henzinger, Marcin...