Sciweavers

263 search results - page 42 / 53
» On a Labeled Vehicle Routing Problem
Sort
View
MOBICOM
2003
ACM
15 years 5 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
BROADNETS
2007
IEEE
15 years 6 months ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
ICPR
2002
IEEE
16 years 24 days ago
Illumination Invariant Segmentation of Spatio-Temporal Images by Spatio-Temporal Markov Random Field Model
For many years, object tracking in images has suffered from the problems of occlusions and illumination effects. In order to resolve occlusion problems, we have been proposing the...
Shunsuke Kamijo, Katsushi Ikeuchi, Masao Sakauchi
CN
2006
75views more  CN 2006»
14 years 11 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
DAGSTUHL
2007
15 years 1 months ago
Approximating min-max k-clustering
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
Asaf Levin