Sciweavers

272 search results - page 8 / 55
» A Game-Theoretic Approach to Constraint Satisfaction
Sort
View
AAAI
2007
15 years 1 days ago
Transposition Tables for Constraint Satisfaction
In this paper, a state-based approach for the Constraint Satisfaction Problem (CSP) is proposed. The key novelty is an original use of state memorization during search to prevent ...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
DSOM
2004
Springer
15 years 3 months ago
Using Object-Oriented Constraint Satisfaction for Automated Configuration Generation
In this paper, we describe an approach for automatically generating configurations for complex applications. Automated generation of system co nfigurations is required to allow lar...
Tim Hinrichs, Nathaniel Love, Charles J. Petrie, L...
SCP
2011
228views Communications» more  SCP 2011»
14 years 4 months ago
Channel-based coordination via constraint satisfaction
Coordination in Reo emerges from the composition of the behavioural constraints of primitives, such as channels, in a component connector. Understanding and implementing Reo, howe...
Dave Clarke, José Proença, Alexander...
MICAI
2004
Springer
15 years 3 months ago
Evaluation-Based Semiring Meta-constraints
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
Jerome Kelleher, Barry O'Sullivan
MFCS
2007
Springer
15 years 3 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers