150 search results - page 22 / 30 » Solving Permutation Constraint Satisfaction Problems with Ar... |
78
Voted
CSCLP
2007
Springer
15 years 5 months ago
2007
Springer
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
181
click to vote
CP
2009
Springer
16 years 8 days ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
120
click to vote
AUSAI
2008
Springer
15 years 1 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
—This paper describes an evolutionary music composition system that combines trainable music critics with a bag of notes constraint. Unlike many evolutionary composition systems,...
ICTAI
2007
IEEE
15 years 6 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...