Sciweavers

654 search results - page 53 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
CISS
2008
IEEE
14 years 3 months ago
Optimizing wireless networks for heterogeneous spatial loads
—Large-scale wireless networks must be designed such that there are no gaps in coverage. It is also desirable to minimize the number of access points used in order to minimize th...
Balaji Rengarajan, Gustavo de Veciana
SAC
2005
ACM
14 years 2 months ago
Efficient placement and routing in grid-based networks
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
Roozbeh Jafari, Foad Dabiri, Bo-Kyung Choi, Majid ...
ICNP
2005
IEEE
14 years 2 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu
DATAMINE
2010
175views more  DATAMINE 2010»
13 years 9 months ago
Extracting influential nodes on a social network for information diffusion
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...
IMCSIT
2010
13 years 6 months ago
Effectiveness of Solving Traveling Salesman Problem Using Ant Colony Optimization on Distributed Multi-Agent Middleware
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
Sorin Ilie, Costin Badica