Sciweavers

2796 search results - page 78 / 560
» The coolest path problem
Sort
View
APNOMS
2009
Springer
15 years 11 months ago
A Scheme for Supporting Optimal Path in 6LoWPAN Based MANEMO Networks
In this paper, we focus on the scheme for the route optimization in 6LoWPAN based MANEMO environments. If 6LoWPAN mobile routers for supporting NEMO protocol are organized by neste...
Jin Ho Kim, Choong Seon Hong
ISCC
2005
IEEE
104views Communications» more  ISCC 2005»
15 years 10 months ago
Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
Zhanfeng Jia, Rajarshi Gupta, Jean C. Walrand, Pra...
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 2 months ago
Improved analysis methods for crossover-based algorithms
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
Benjamin Doerr, Madeleine Theile
AAIM
2008
Springer
105views Algorithms» more  AAIM 2008»
15 years 11 months ago
Finding Optimal Refueling Policies in Transportation Networks
We study the combinatorial properties of optimal refueling policies, which specify the transportation paths and the refueling operations along the paths to minimize the total trans...
Shieu-Hong Lin
ICRA
2006
IEEE
72views Robotics» more  ICRA 2006»
15 years 10 months ago
Multi-robot Boundary Coverage with Plan Revision
Abstract— This paper revisits the multi-robot boundary coverage problem in which a group of k robots must inspect every point on the boundary of a 2-dimensional environment. We f...
Kjerstin Williams, Joel Burdick