Sciweavers

1110 search results - page 12 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
HEURISTICS
2007
165views more  HEURISTICS 2007»
14 years 11 months ago
New heuristics for the maximum diversity problem
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
Geiza C. Silva, Marcos R. Q. de Andrade, Luiz Sato...
WCNC
2010
IEEE
15 years 3 months ago
A Lightweight Distributed Solution to Content Replication in Mobile Networks
Abstract—Performance and reliability of content access in mobile networks is conditioned jointly by the number and location of content replicas deployed at the network nodes. The...
C.-A. La, Pietro Michiardi, Claudio Casetti, Carla...
EUROPAR
2010
Springer
14 years 11 months ago
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
Marin Bougeret, Pierre-François Dutot, Klau...
HM
2010
Springer
157views Optimization» more  HM 2010»
15 years 18 days ago
Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem
Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP) is a scheduling problem that works with an uncommon kind of resources: the Dynamic Resources. They increase and dec...
André Renato Villela da Silva, Luiz Satoru ...
ATAL
2007
Springer
15 years 3 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...