Sciweavers

570 search results - page 59 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
HEURISTICS
2008
124views more  HEURISTICS 2008»
13 years 9 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
ICASSP
2010
IEEE
13 years 7 months ago
Unidirectional graph-based wavelet transforms for efficient data gathering in sensor networks
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
Sunil K. Narang, Godwin Shen, Antonio Ortega
TPDS
2002
173views more  TPDS 2002»
13 years 8 months ago
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an...
Stephanie Lindsey, Cauligi S. Raghavendra, Krishna...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 3 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
WINET
2010
113views more  WINET 2010»
13 years 7 months ago
Designing multihop wireless backhaul networks with delay guarantees
— As wireless access technologies improve in data rates, the problem focus is shifting towards providing adequate backhaul from the wireless access points to the Internet. Existi...
Girija J. Narlikar, Gordon T. Wilfong, Lisa Zhang