Sciweavers

13214 search results - page 354 / 2643
» Pseudorandomness for network algorithms
Sort
View
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 6 months ago
Mosaic: Policy Homomorphic Network Extension
With the advent of large-scale cloud computing infrastructures, network extension has emerged as a major challenge in the management of modern enterprise networks. Many enterprise...
L. Erran Li, Michael F. Nowlan, Y. R. Yang
NETWORK
2010
122views more  NETWORK 2010»
15 years 1 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
ICNP
2006
IEEE
16 years 25 days ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das
IWCMC
2006
ACM
16 years 23 days ago
Energy efficient distributed connected dominating sets construction in wireless sensor networks
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...
Yuanyuan Zeng, Xiaohua Jia, Yanxiang He
ISIPTA
2005
IEEE
157views Mathematics» more  ISIPTA 2005»
16 years 12 days ago
Possibilistic Networks with Locally Weighted Knowledge Bases
Possibilistic networks and possibilistic logic bases are important tools to deal with uncertain pieces of information. Both of them offer a compact representation of possibility ...
Salem Benferhat, Salma Smaoui