Sciweavers

13214 search results - page 410 / 2643
» Pseudorandomness for network algorithms
Sort
View
GLOBECOM
2007
IEEE
16 years 1 months ago
Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...
Chen Wang, My T. Thai, Yingshu Li, Feng Wang 0002,...
MOBIHOC
2002
ACM
16 years 6 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
CEC
2007
IEEE
16 years 1 months ago
Improving generalization capability of neural networks based on simulated annealing
— This paper presents a single-objective and a multiobjective stochastic optimization algorithms for global training of neural networks based on simulated annealing. The algorith...
Yeejin Lee, Jong-Seok Lee, Sun-Young Lee, Cheol Ho...
WCNC
2010
IEEE
15 years 10 months ago
Prioritized Resource Sharing in WiMax and WiFi Integrated Networks
Abstract—In order to ensure fair access and efficiency of bandwidth usage in wireless integrated networks, resource allocation algorithms should be well designed. In this paper,...
Nirmal Andrews, Yogesh Reddy Kondareddy, Prathima ...
MASCOTS
2010
15 years 8 months ago
Distributed Routing for Vehicular Ad Hoc Networks: Throughput-Delay Tradeoff
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points,...
Ali Abedi, Majid Ghaderi, Carey L. Williamson