Sciweavers

654 search results - page 10 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
ALGOSENSORS
2009
Springer
14 years 2 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
DCOSS
2007
Springer
13 years 11 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
MOR
2007
149views more  MOR 2007»
13 years 7 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
13 years 7 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
ESANN
2006
13 years 9 months ago
Optimal design of hierarchical wavelet networks for time-series forecasting
The purpose of this study is to identify the Hierarchical Wavelet Neural Networks (HWNN) and select important input features for each sub-wavelet neural network automatically. Base...
Yuehui Chen, Bo Yang, Ajith Abraham