Sciweavers

2771 search results - page 535 / 555
» A General Computational Treatment of the Comparative
Sort
View
NGC
2000
Springer
14 years 2 months ago
The use of hop-limits to provide survivable ATM group communications
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
William Yurcik, David Tipper, Deep Medhi
WEBDB
2000
Springer
128views Database» more  WEBDB 2000»
14 years 2 months ago
Architecting a Network Query Engine for Producing Partial Results
The growth of the Internet has made it possible to query data in all corners of the globe. This trend is being abetted by the emergence of standards for data representation, such ...
Jayavel Shanmugasundaram, Kristin Tufte, David J. ...
CSFW
2010
IEEE
14 years 2 months ago
A Framework for the Sound Specification of Cryptographic Tasks
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the "trusted-party paradigm," where the protocol execution is compar...
Juan A. Garay, Aggelos Kiayias, Hong-Sheng Zhou
ATAL
2008
Springer
14 years 28 days ago
Decentralised coordination of low-power embedded devices using the max-sum algorithm
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
Alessandro Farinelli, Alex Rogers, Adrian Petcu, N...
ATAL
2008
Springer
14 years 28 days ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...