1300 search results - page 13 / 260 » Constraint satisfaction problems and global cardinality cons... |
AICCSA
2001
IEEE
15 years 1 months ago
2001
IEEE
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...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
111
click to vote
FLAIRS
2008
14 years 12 months ago
2008
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...
AI
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
DAGSTUHL
2008
14 years 11 months ago
2008
In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the non-existence of other homomorphisms. In this survey paper, we give ...