Sciweavers

1719 search results - page 136 / 344
» Scheduling with soft constraints
Sort
View
ICTAI
2006
IEEE
14 years 4 months ago
Incremental Filtering Algorithms for Precedence and Dependency Constraints
Precedence constraints play a crucial role in planning and scheduling problems. Many real-life problems also include dependency constraints expressing logical relations between the...
Roman Barták, Ondrej Cepek
CP
2004
Springer
14 years 2 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...
AI
2005
Springer
13 years 10 months ago
Asynchronous aggregation and consistency in distributed constraint satisfaction
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
Marius-Calin Silaghi, Boi Faltings

Book
357views
15 years 8 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang
PPDP
1999
Springer
14 years 2 months ago
Constraint Programming in OPL
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the rst modeling language to combine high-level algebraic and set notations f...
Pascal Van Hentenryck, Laurent Michel, Laurent Per...