Sciweavers

601 search results - page 2 / 121
» CSP(M): Constraint Satisfaction Problem over Models
Sort
View
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 3 months ago
Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
Jeroen Keppens, Qiang Shen
CONSTRAINTS
2007
120views more  CONSTRAINTS 2007»
14 years 11 months ago
Automatic Generation of Redundant Models for Permutation Constraint Satisfaction Problems
Yat Chiu Law, Jimmy Ho-Man Lee, Barbara M. Smith
78
Voted
CP
2005
Springer
15 years 5 months ago
Distributed Constraints for Large-Scale Scheduling Problems
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
Montserrat Abril, Miguel A. Salido, Federico Barbe...
CONSTRAINTS
2010
75views more  CONSTRAINTS 2010»
14 years 9 months ago
Redundant modeling in permutation weighted constraint satisfaction problems
Yat Chiu Law, Jimmy Ho-Man Lee, May H. C. Woo
FLAIRS
2004
15 years 1 months ago
CSAA: A Distributed Ant Algorithm Framework for Constraint Satisfaction
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
Koenraad Mertens, Tom Holvoet