92 search results - page 5 / 19 » Interactively Solving School Timetabling Problems Using Exte... |
112
click to vote
CP
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
93
Voted
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
101
click to vote
SAC
1994
ACM
15 years 3 months ago
1994
ACM
An extension of Me parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to dea...
101
click to vote
CHARME
2003
Springer
15 years 4 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
EMNLP
2008
15 years 1 months ago
2008
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...