Sciweavers

1578 search results - page 75 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
OPODIS
2004
13 years 10 months ago
Embedded Systems - Challenges and Work Directions
Embedded Systems are components integrating software and hardware jointly and specifically designed to provide given functionalities. These components may be used in many different...
Joseph Sifakis
ICC
2007
IEEE
203views Communications» more  ICC 2007»
14 years 3 months ago
Distributed Cooperative Routing for UWB Ad-Hoc Networks
— Ultra wide band (UWB) ad-hoc networks have attracted much research attention in recent years. This paper proposes and investigates a new distributed cooperative routing strateg...
Shouhong Zhu, Kin K. Leung
AINA
2007
IEEE
14 years 3 months ago
A Distributed and Dynamic Data Gathering Protocol for Sensor Networks
In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor n...
Hüseyin Özgür Tan, Ibrahim Korpeogl...
ISAAC
2003
Springer
92views Algorithms» more  ISAAC 2003»
14 years 1 months ago
Wavelength Conversion in Shortest-Path All-Optical Networks
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their...
Thomas Erlebach, Stamatis Stefanakos
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 10 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...