Sciweavers

2796 search results - page 160 / 560
» The coolest path problem
Sort
View
IROS
2008
IEEE
158views Robotics» more  IROS 2008»
16 years 19 days ago
A model-predictive approach to formation control of omnidirectional mobile robots
— This paper presents a solution to the problem of steering a group of real omnidirectional mobile robots along a given path, while maintaining a desired formation pattern. This ...
Kiattisin Kanjanawanishkul, Andreas Zell
INFOCOM
2012
IEEE
13 years 8 months ago
DEAR: Delay-bounded Energy-constrained Adaptive Routing in wireless sensor networks
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, Cho...
DISOPT
2006
101views more  DISOPT 2006»
15 years 6 months ago
Greedy-type resistance of combinatorial problems
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
Gareth Bendall, François Margot
157
Voted
AMC
2005
127views more  AMC 2005»
15 years 6 months ago
The identification of nondominated and efficient paths on a network
In this paper, we present an application of 0-1 linear programming problem in the indentification of the nondominated paths on a network. To find efficient paths, an adaptationof t...
Gholam Reza Jahanshahloo, F. Hosseinzadeh Lotfi, N...
146
Voted
APPROX
2004
Springer
165views Algorithms» more  APPROX 2004»
15 years 11 months ago
Approximating Additive Distortion of Embeddings into Line Metrics
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
Kedar Dhamdhere