Sciweavers

1453 search results - page 9 / 291
» Partial Constraint Satisfaction
Sort
View
IAT
2007
IEEE
14 years 5 months ago
CompAPO: A Complete Version of the APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
AI
2004
Springer
14 years 4 months ago
Constraint Satisfaction Methods for Information Personalization
Constraints formalize the dependencies in a physical world in terms of a logical relation among several unknowns. Constraint satisfaction methods allow efficient navigation of larg...
Syed Sibte Raza Abidi, Yong Han Chong
CONSTRAINTS
2007
120views more  CONSTRAINTS 2007»
13 years 11 months ago
Automatic Generation of Redundant Models for Permutation Constraint Satisfaction Problems
Yat Chiu Law, Jimmy Ho-Man Lee, Barbara M. Smith
CP
2010
Springer
13 years 9 months ago
Including Ordinary Differential Equations Based Constraints in the Standard CP Framework
Coupling constraints and ordinary differential equations has numerous applications. This paper shows how to introduce constraints involving ordinary differential equations into the...
Alexandre Goldsztejn, Olivier Mullier, Damien Evei...
GI
2009
Springer
14 years 3 months ago
Constraint Checking for Business Process Management
: Compliance management tackles issues related to both modelling and enforcement of business constraints in enterprises. In the context of business process management, we propose a...
Wolfgang Runte, Marwane El Kharbili