Sciweavers

55 search results - page 2 / 11
» Incremental Filtering Algorithms for Precedence and Dependen...
Sort
View
SODA
2001
ACM
125views Algorithms» more  SODA 2001»
13 years 7 months ago
Parallel processor scheduling with delay constraints
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
ESOP
2004
Springer
13 years 11 months ago
From Constraints to Finite Automata to Filtering Algorithms
Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...
Mats Carlsson, Nicolas Beldiceanu
NIPS
2008
13 years 7 months ago
Modeling the effects of memory on human online sentence processing with particle filters
Language comprehension in humans is significantly constrained by memory, yet rapid, highly incremental, and capable of utilizing a wide range of contextual information to resolve ...
Roger P. Levy, Florencia Reali, Thomas L. Griffith...
CP
2004
Springer
13 years 9 months ago
Unary Resource Constraint with Optional Activities
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
Petr Vilím, Roman Barták, Ondrej Cep...
AAAI
2010
13 years 7 months ago
Filtering Bounded Knapsack Constraints in Expected Sublinear Time
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack c...
Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek