Sciweavers

3247 search results - page 214 / 650
» Randomized smoothing networks
Sort
View
INFOCOM
2005
IEEE
15 years 10 months ago
Designing incentives for peer-to-peer routing
Abstract— In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of “free-loaders,” nodes that use the network but r...
Alberto Blanc, Yi-Kai Liu, Amin Vahdat
WAC
2005
Springer
15 years 10 months ago
On Natural Mobility Models
Abstract. There is an increasing consensus that existing mobility models, such as the well-known random walk or random waypoint models, are insufficient to represent real node mobi...
Vincent Borrel, Marcelo Dias de Amorim, Serge Fdid...
134
Voted
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
15 years 9 months ago
Asynchronous gossip algorithms for stochastic optimization
Abstract— We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of ...
Sundhar Srinivasan Ram, Angelia Nedic, Venugopal V...
OPODIS
2007
15 years 6 months ago
Deterministic Communication in the Weak Sensor Model
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
Antonio Fernández Anta, Miguel A. Mosteiro,...
148
Voted
IJON
2000
85views more  IJON 2000»
15 years 4 months ago
Hebbian learning and temporary storage in the convergence-zone model of episodic memory
The Convergence-Zone model shows how sparse, random memory patterns can lead to one-shot storage and high capacity in the hippocampal component of the episodic memory system. This...
Michael Howe, Risto Miikkulainen