Sciweavers

80 search results - page 8 / 16
» Grouping Techniques for Scheduling Problems: Simpler and Fas...
Sort
View
ACMDIS
2010
ACM
13 years 8 months ago
Incorporating user control in automated interactive scheduling systems
In this paper, we report our findings on the impact of providing users with varying degrees of control in an automated interactive scheduling system. While automated scheduling te...
Jina Huh, Martha E. Pollack, Hadi Katebi, Karem A....
SODA
2012
ACM
209views Algorithms» more  SODA 2012»
11 years 11 months ago
Simple and practical algorithm for sparse Fourier transform
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
DATE
2007
IEEE
95views Hardware» more  DATE 2007»
14 years 2 months ago
Memory bank aware dynamic loop scheduling
In a parallel system with multiple CPUs, one of the key problems is to assign loop iterations to processors. This problem, known as the loop scheduling problem, has been studied i...
Mahmut T. Kandemir, Taylan Yemliha, Seung Woo Son,...
CP
2009
Springer
14 years 3 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
CP
2003
Springer
14 years 1 months ago
Comparison of Symmetry Breaking Methods
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Karen E. Petrie