Sciweavers

12 search results - page 2 / 3
» MARA: Maximum Alternative Routing Algorithm
Sort
View
ADHOC
2007
121views more  ADHOC 2007»
13 years 5 months ago
Power-aware single- and multipath geographic routing in sensor networks
Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a signi...
Shibo Wu, K. Selçuk Candan
COR
2008
99views more  COR 2008»
13 years 5 months ago
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based ...
Mohammed S. Zahrani, Martin J. Loomes, James A. Ma...
ICASSP
2009
IEEE
14 years 10 days ago
Adaptive distributed transforms for irregularly sampled Wireless Sensor Networks
We develop energy-efficient, adaptive distributed transforms for data gathering in wireless sensor networks. In particular, we consider a class of unidirectional transforms that ...
Godwin Shen, Sunil K. Narang, Antonio Ortega
ATMOS
2010
134views Optimization» more  ATMOS 2010»
13 years 4 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
13 years 11 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke