Sciweavers

7758 search results - page 1352 / 1552
» On the Number of Distributive Lattices
Sort
View
PODC
2010
ACM
15 years 10 months ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
ASIACRYPT
2006
Springer
15 years 10 months ago
On the (In)security of Stream Ciphers Based on Arrays and Modular Addition
Abstract. Stream ciphers play an important role in symmetric cryptology because of their suitability in high speed applications where block ciphers fall short. A large number of fa...
Souradyuti Paul, Bart Preneel
ATAL
2006
Springer
15 years 10 months ago
Accident or intention: that is the question (in the Noisy Iterated Prisoner's Dilemma)
This paper focuses on the Noisy Iterated Prisoner's Dilemma, a version of the Iterated Prisoner's Dilemma (IPD) in which there is a nonzero probability that a "coop...
Tsz-Chiu Au, Dana S. Nau
CLUSTER
2004
IEEE
15 years 10 months ago
FTC-Charm++: an in-memory checkpoint-based fault tolerant runtime for Charm++ and MPI
As high performance clusters continue to grow in size, the mean time between failure shrinks. Thus, the issues of fault tolerance and reliability are becoming one of the challengi...
Gengbin Zheng, Lixia Shi, Laxmikant V. Kalé
ATAL
2006
Springer
15 years 10 months ago
A context-aware approach for service selection using ontologies
Selecting the right parties to interact with is a fundamental problem in open and dynamic environments. The problem is exemplified when the number of interacting parties is high a...
Murat Sensoy, Pinar Yolum
« Prev « First page 1352 / 1552 Last » Next »