Sciweavers

942 search results - page 6 / 189
» Distance Constraint Satisfaction Problems
Sort
View
FLAIRS
2008
13 years 9 months ago
Reformulating Constraint Models for Classical Planning
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint s...
Roman Barták, Daniel Toropila
GI
2009
Springer
13 years 12 months ago
Constraint Checking for Business Process Management
: Compliance management tackles issues related to both modelling and enforcement of business constraints in enterprises. In the context of business process management, we propose a...
Wolfgang Runte, Marwane El Kharbili
CP
2010
Springer
13 years 5 months ago
Including Ordinary Differential Equations Based Constraints in the Standard CP Framework
Coupling constraints and ordinary differential equations has numerous applications. This paper shows how to introduce constraints involving ordinary differential equations into the...
Alexandre Goldsztejn, Olivier Mullier, Damien Evei...
AICCSA
2001
IEEE
131views Hardware» more  AICCSA 2001»
13 years 11 months ago
Constraint-Based Timetabling-A Case Study
This paper2 details the stages of building a substantial, carefully specified, fully tested and fully operational university and school timetabling system. This is reported as a c...
Abdulwahed M. Abbas, Edward P. K. Tsang
CSR
2007
Springer
14 years 1 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen