Sciweavers

14739 search results - page 199 / 2948
» An optimization problem on the sphere
Sort
View
WADS
2007
Springer
184views Algorithms» more  WADS 2007»
15 years 5 months ago
A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanj...
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
15 years 4 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava
HM
2010
Springer
133views Optimization» more  HM 2010»
15 years 2 days ago
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...
Luca Di Gaspero, Johannes Gärtner, Nysret Mus...
HM
2010
Springer
157views Optimization» more  HM 2010»
15 years 2 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 ...
EOR
2007
87views more  EOR 2007»
14 years 11 months ago
The TV-Break Packing Problem
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
Thierry Benoist, Eric Bourreau, Benoît Rotte...