Sciweavers

835 search results - page 45 / 167
» Finding Optimal Solutions to Cooperative Pathfinding Problem...
Sort
View
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
14 years 2 months ago
Improving particle swarm optimization with differentially perturbed velocity
This paper introduces a novel scheme of improving the performance of particle swarm optimization (PSO) by a vector differential operator borrowed from differential evolution (DE)....
Swagatam Das, Amit Konar, Uday Kumar Chakraborty
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 8 months ago
Generalized Traveling Salesman Problem Reduction Algorithms
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...
Gregory Gutin, Daniel Karapetyan
JCO
2002
96views more  JCO 2002»
13 years 8 months ago
On the Robust Single Machine Scheduling Problem
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
Jian Yang, Gang Yu
PODC
2010
ACM
14 years 11 days ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
ATMOS
2008
112views Optimization» more  ATMOS 2008»
13 years 10 months ago
Dynamic Algorithms for Recoverable Robustness Problems
Abstract. Recently, the recoverable robustness model has been introduced in the optimization area. This model allows to consider disruptions (input data changes) in a unified way, ...
Serafino Cicerone, Gabriele Di Stefano, Michael Sc...