Sciweavers

620 search results - page 4 / 124
» The computational power of population protocols
Sort
View
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 4 months ago
On the algebraic numbers computable by some generalized Ehrenfest urns
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
Marie Albenque, Lucas Gerin
ASIACRYPT
2001
Springer
14 years 1 months ago
Efficient and Mutually Authenticated Key Exchange for Low Power Computing Devices
Abstract. In this paper, we consider the problem of mutually authenticated key exchanges between a low-power client and a powerful server. We show how the Jakobsson-Pointcheval sch...
Duncan S. Wong, Agnes Hui Chan
PAM
2010
Springer
13 years 11 months ago
A Probabilistic Population Study of the Conficker-C Botnet
We estimate the number of active machines per hour infected with the Conficker-C worm, using a probability model of Conficker-C's UDP P2P scanning behavior. For an observer wi...
Rhiannon Weaver
SSPR
2010
Springer
13 years 8 months ago
Fast Population Game Dynamics for Dominant Sets and Other Quadratic Optimization Problems
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
Samuel Rota Bulò, Immanuel M. Bomze, Marcel...
IPPS
2008
IEEE
14 years 4 months ago
Self-stabilizing population of mobile agents
We investigate a problem of maintaining a target population of mobile agents in a distributed system. The purpose of the agents is to perform certain activities, so the goal is to...
Zbigniew Golebiewski, Miroslaw Kutylowski, Tomasz ...