Sciweavers

5793 search results - page 1024 / 1159
» Individual communication complexity
Sort
View
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
14 years 1 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
APAQS
2001
IEEE
14 years 1 months ago
Incremental Fault-Tolerant Design in an Object-Oriented Setting
With the increasing emphasis on dependability in complex, distributed systems, it is essential that system development can be done gradually and at different levels of detail. In ...
Einar Broch Johnsen, Olaf Owe, Ellen Munthe-Kaas, ...
CAV
2001
Springer
154views Hardware» more  CAV 2001»
14 years 1 months ago
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
CIA
2000
Springer
14 years 1 months ago
Emergent Societies of Information Agents
In the near future, billions of entities will be connected to each other through the Internet. The current trend is that an increasingly number of entities, from smart personal dev...
Paul Davidsson
EUROCRYPT
2000
Springer
14 years 1 months ago
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Voting schemes that provide receipt-freeness prevent voters from proving their cast vote, and hence thwart vote-buying and coercion. We analyze the security of the multi-authority ...
Martin Hirt, Kazue Sako
« Prev « First page 1024 / 1159 Last » Next »