Sciweavers

332 search results - page 46 / 67
» Traveling salesman path problems
Sort
View
GECCO
2006
Springer
189views Optimization» more  GECCO 2006»
13 years 11 months ago
Game theory as a new paradigm for phenotype characterization of genetic algorithms
In this paper, it is presented a new way to characterize the phenotype in the context of Genetic Algorithms through the use of Game Theory as a theoretical foundation to define a ...
Otávio Noura Teixeira, Artur Noura Teixeira...
JAL
2006
175views more  JAL 2006»
13 years 7 months ago
Approximations for minimum and min-max vehicle routing problems
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
Esther M. Arkin, Refael Hassin, Asaf Levin
JUCS
2008
200views more  JUCS 2008»
13 years 7 months ago
Tabu Search on GPU
: Nowadays Personal Computers (PCs) are often equipped with powerful, multi-core CPU. However, the processing power of the modern PC does not depend only of the processing power of...
Adam Janiak, Wladyslaw A. Janiak, Maciej Lichtenst...
ICRA
2010
IEEE
119views Robotics» more  ICRA 2010»
13 years 6 months ago
Evader surveillance under incomplete information
— This paper is concerned with determining whether a mobile robot, called the pursuer, is up to maintaining visibility of an antagonist agent, called the evader. This problem, a ...
Israel Becerra, Rafael Murrieta-Cid, Raul Monroy
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
13 years 9 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska