Searching for authors named Pierre Berlandier – sorted by Relevance.
-
The Use and Interpretation of Meta Level Constraints
- This paper introduces a model for dynamic constraint problems in which constraints and variables are comparable entities. This model provides a natural way to represent configuration or design problems wherein the set of objects and their constraints are bound to evolve during the solving process. M
- Cited by 5 (0 self) – Add To MetaCart
-
A Performance Evaluation of Backtrack-Bounded Search Methods for N-ary Constraint Networks
- . An early study on the structural aspect of binary constraint problems has led to the definition of a backtrack bounded solving (bbs) method. In this paper, we apply this method to n-ary constraint problems and we try to weigh the benefits that can be expected from its use. Simple functions are des
- Cited by 1 (0 self) – Add To MetaCart
-
A Symbiotic Approach to Arc and Path Consistency Checking
- . The resolution of constraint satisfaction problems heavily relies on the use of local consistency enforcement procedures which are used to lter the problems before or during their resolution. While procedures based on arc-consistency are almost a standard, path-consistency checking is often ne
- Add To MetaCart
-
A Non-diffident Combinatorial Optimization Algorithm
- Branch and bound is a well known, allpurpose optimization strategy. It relies on the availability of a search tree evaluation function and maintains an upper bound cost as a reference for the pruning. This upper bound is updated each time a better solution is encountered. In this paper, we propose a
- Add To MetaCart
-
Autour Du Problème De Satisfaction De Contraintes
- Introduction Le cadre des problemes de satisfaction de contraintes ou CSP (pour Constraint Satisfaction Problems) a pour finalite l'expression et la resolution de problemes faisant intervenir des contraintes. De facon tres generale, une contrainte correspond a l'enonce d'une proprie te relative a
- Cited by 1 (0 self) – Add To MetaCart

