Sciweavers

13214 search results - page 94 / 2643
» Pseudorandomness for network algorithms
Sort
View
ASUNAM
2011
IEEE
14 years 6 months ago
Is Objective Function the Silver Bullet? A Case Study of Community Detection Algorithms on Social Networks
Abstract—Community detection or cluster detection in networks is a well-studied, albeit hard, problem. Given the scale and complexity of modern day social networks, detecting “...
Yang Yang, Yizhou Sun, Saurav Pandit, Nitesh V. Ch...
MOBIHOC
2001
ACM
16 years 6 months ago
Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
Seapahn Meguerdichian, Sasha Slijepcevic, Vahag Ka...
GECCO
2005
Springer
15 years 12 months ago
Optimizing parameters of a mobile ad hoc network protocol with a genetic algorithm
Mobile ad hoc networks are typically designed and evaluated in generic simulation environments. However the real conditions in which these networks are deployed can be quite diff...
David J. Montana, Jason Redi
EVOW
2007
Springer
16 years 17 days ago
An Adaptive Global-Local Memetic Algorithm to Discover Resources in P2P Networks
This paper proposes a neural network based approach for solving the resource discovery problem in Peer to Peer (P2P) networks and an Adaptive Global Local Memetic Algorithm (AGLMA)...
Ferrante Neri, Niko Kotilainen, Mikko Vapa
ICNP
2006
IEEE
16 years 13 days ago
A Distributed Algorithm for Joint Sensing and Routing in Wireless Networks with Non-Steerable Directional Antennas
Abstract— In many energy-rechargeable wireless sensor networks, sensor nodes must both sense data from the environment, and cooperatively forward sensed data to data sinks. Both ...
Chun Zhang, Jim Kurose, Yong Liu, Donald F. Towsle...