Sciweavers

193 search results - page 36 / 39
» A Lower Bound for the Shortest Path Problem
Sort
View
70
Voted
EOR
2006
128views more  EOR 2006»
14 years 9 months ago
Scatter search for project scheduling with resource availability cost
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
Denise Sato Yamashita, Vinícius Amaral Arme...
90
Voted
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
15 years 9 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
81
Voted
IPPS
2007
IEEE
15 years 3 months ago
A Comparative Study of Parallel Metaheuristics for Protein Structure Prediction on the Computational Grid
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...
60
Voted
IPPS
2007
IEEE
15 years 3 months ago
Strategies for Replica Placement in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
Anne Benoit, Veronika Rehn, Yves Robert
79
Voted
SIAMDM
2008
79views more  SIAMDM 2008»
14 years 9 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...