Sciweavers

599 search results - page 93 / 120
» The traveling salesman problem
Sort
View
IROS
2006
IEEE
97views Robotics» more  IROS 2006»
14 years 1 months ago
Probabilistic Search for a Moving Target in an Indoor Environment
– We consider a search for a target moving within a known indoor environment partitioned into interconnected regions of varying sizes. The knowledge of target location is describ...
Haye Lau, Shoudong Huang, Gamini Dissanayake
INFOCOM
2005
IEEE
14 years 1 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
EOR
2007
72views more  EOR 2007»
13 years 7 months ago
Placing a finite size facility with a center objective on a rectangular plane with barriers
This paper addresses the finite size 1-center placement problem on a rectangular plane in the presence of barriers. Barriers are regions in which both facility location and trave...
Avijit Sarkar, Rajan Batta, Rakesh Nagi
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
13 years 7 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
CEC
2010
IEEE
12 years 11 months ago
A hybrid genetic algorithm for rescue path planning in uncertain adversarial environment
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
Jean Berger, Khaled Jabeur, Abdeslem Boukhtouta, A...