150 search results - page 15 / 30 » Solving Permutation Constraint Satisfaction Problems with Ar... |
129
click to vote
CP
2007
Springer
15 years 5 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...
CP
2005
Springer
15 years 5 months ago
2005
Springer
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
102
click to vote
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
Modern vehicles possess an increasing number of software and hardware components that are integrated in electronic control units (ECUs). Finding an optimal allocation for all comp...
91
Voted
ECAI
2010
Springer
15 years 25 days ago
2010
Springer
Abstract. This paper introduces restart and nogood recording techniques in the domain of qualitative spatial and temporal reasoning. Nogoods and restarts can be applied orthogonall...
105
click to vote
CP
2001
Springer
15 years 4 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...