Sciweavers

862 search results - page 97 / 173
» Random Information Spread in Networks
Sort
View
APIN
2007
118views more  APIN 2007»
15 years 7 hour ago
Using genetic algorithms to reorganize superpeer structure in peer to peer networks
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
Jaymin Kessler, Khaled Rasheed, Ismailcem Budak Ar...
ISI
2010
Springer
14 years 10 months ago
Measuring behavioral trust in social networks
Abstract—Trust is an important yet complex and little understood dyadic relation among actors in a social network. There are many dimensions to trust; trust plays an important ro...
Sibel Adali, Robert Escriva, Mark K. Goldberg, Myk...
IPSN
2004
Springer
15 years 5 months ago
Naps: scalable, robust topology management in wireless ad hoc networks
Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connec...
Brighten Godfrey, David Ratajczak
FOCS
2002
IEEE
15 years 4 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
70
Voted
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
15 years 6 months ago
Latency Analysis of Coalescence for Robot Groups
— Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communicat...
Sameera Poduri, Gaurav S. Sukhatme