405 search results - page 51 / 81 » On the Complexity of Global Constraint Satisfaction |
ICTAI
2000
IEEE
15 years 3 months ago
2000
IEEE
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial con...
100
click to vote
FROCOS
2000
Springer
15 years 2 months ago
2000
Springer
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
CP
1999
Springer
15 years 3 months ago
1999
Springer
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
110
click to vote
CLEIEJ
2006
14 years 11 months ago
2006
Concurrent process calculi are powerful formalisms for modelling concurrent systems. The mathematical style underlying process calculi allow to both model and verify properties of...
CPAIOR
2007
Springer
15 years 5 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...