Sciweavers

1110 search results - page 4 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
IPPS
2009
IEEE
14 years 3 months ago
New sequential and parallel algorithm for Dynamic Resource Constrained Project Scheduling Problem
This paper proposes a new Evolutionary Algorithm for the Dynamic Resource Constrained Project Scheduling Problem. This algorithm has new features that get around some problems lik...
André Renato Villela da Silva, Luiz Satoru ...
AIPS
2004
13 years 10 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
EDBT
2004
ACM
129views Database» more  EDBT 2004»
14 years 8 months ago
Beyond 1-Safety and 2-Safety for Replicated Databases: Group-Safety
In this paper, we study the safety guarantees of group communication-based database replication techniques. We show that there is a model mismatch between group communication and ...
Matthias Wiesmann, André Schiper
NETWORKS
2008
13 years 8 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
13 years 10 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan