Sciweavers

2270 search results - page 412 / 454
» On the distribution of eigenvalues of graphs
Sort
View
JPDC
2007
191views more  JPDC 2007»
13 years 8 months ago
Clustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
Bo Han, Weijia Jia
TWC
2008
80views more  TWC 2008»
13 years 8 months ago
Robust connectivity-aware energy-efficient routing for wireless sensor networks
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
Charles Pandana, K. J. Ray Liu
CN
2004
114views more  CN 2004»
13 years 8 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford
ML
2000
ACM
150views Machine Learning» more  ML 2000»
13 years 8 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew
PPL
2000
110views more  PPL 2000»
13 years 8 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna