Sciweavers

854 search results - page 65 / 171
» A General Vehicle Routing Problem
Sort
View
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
16 years 2 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...
147
Voted
WSNA
2003
ACM
15 years 7 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng
108
Voted
GLOBECOM
2009
IEEE
15 years 6 months ago
Optimized Protection Schemes for Resilient Interdomain Traffic Distribution
Abstract-- Due to the development of Next Generation Networks, leading to a multiservice transport layer with a multidomain environment, the importance of interconnection issues ke...
Miroslaw Kantor, Piotr Cholda, Andrzej Jajszczyk
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
15 years 11 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller
130
Voted
GLOBECOM
2008
IEEE
15 years 9 months ago
A Dynamic Programming Approach for Routing in Wireless Mesh Networks
—The routing problem in Wireless Mesh Networks is concerned with finding “good” source-destination paths. It generally faces multiple objectives to be optimized, such as i) ...
Jorge Crichigno, Joud Khoury, Min-You Wu, Wei Shu