2109 search results - page 65 / 422 » Solving Necklace Constraint Problems |
132
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
The Disjunctive Temporal Problem with Uncertainty (DTPU) is an extension of the Disjunctive Temporal Problem (DTP) that accounts for events not under the control of the executing a...
119
click to vote
AAAI
2004
15 years 6 months ago
2004
We describe the problem of scheduling the television broadcasts of the U.S. National Football League (NFL). Unlike traditional round-robin tournament scheduling, the NFL problem i...
132
Voted
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...
148
click to vote
ENTCS
2007
15 years 4 months ago
2007
Soft constraints extend classical constraints to deal with non-functional requirements, overconstrained problems and preferences. Bistarelli, Montanari and Rossi have developed a ...
122
click to vote
MICAI
2004
Springer
15 years 10 months ago
2004
Springer
A preprocessing procedure that uses a local guided search defined in terms of a neighborhood structure to get a feasible solution (UB) and the Osorio and Glover[18, 20] exploiting ...