Sciweavers

228 search results - page 11 / 46
» Optimization of Multiple Vehicle Routing Problems using Appr...
Sort
View
DCC
2002
IEEE
14 years 7 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
ICPPW
2002
IEEE
14 years 9 days ago
Finding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
Weifa Liang, Xiaojun Shen
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
14 years 23 days ago
Evolution-Based Deliberative Planning for Cooperating Unmanned Ground Vehicles in a Dynamic Environment
Many challenges remain in the development of tactical planning systems that will enable automated, cooperative replanning of routes and mission assignments for multiple unmanned gr...
Talib S. Hussain, David J. Montana, Gordon Vidaver
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 8 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
TMC
2010
196views more  TMC 2010»
13 years 5 months ago
Joint Routing, Channel Assignment, and Scheduling for Throughput Maximization in General Interference Models
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...
Mahmoud Al-Ayyoub, Himanshu Gupta