Dynamic Backtracking with Constraint Propagation Application to static and dynamic CSPs
暂无分享,去创建一个
[1] Patrice Boizumault,et al. A Best First approach for solving over-constrained dynamic problems , 1997, IJCAI 1997.
[2] Romuald Debruyne,et al. Les algorithmes d'arc-consistance dans les CSP dynamiques , 1995 .
[3] Thomas C. Henderson,et al. Arc and Path Consistency Revisited , 1986, Artif. Intell..
[4] Patrick Prosser,et al. MAC-CBJ: maintaining arc consistency with conflict-directed backjumping , 1995 .
[5] Matthew L. Ginsberg,et al. Dynamic Backtracking , 1993, J. Artif. Intell. Res..
[6] Pascal Van Hentenryck,et al. A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..
[7] G. Verfaillie,et al. Maintien de solution dans les problèmes dynamiques de satisfaction de contraintes : bilan de quelques approches , 1995 .
[8] Patrick Prosser,et al. Binary Constraint Satisfaction Problems: Some are Harder than Others , 1994, ECAI.
[9] Jan Maluszy¿ski,et al. Best-first search for property maintenance in reactive constraints systems , 1997 .
[10] Patrick Prosser,et al. HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..
[11] Eugene C. Freuder,et al. Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.
[12] Jean-Charles Régin,et al. Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.
[13] I. G. BONNER CLAPPISON. Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.
[14] Patrice Boizumault,et al. Stratégies en meilleur d'abord pour la relaxation de contraintes , 1997, JFPLC.
[15] Narendra Jussien,et al. Relaxation de Contraintes pour les problèmes dynamiques , 1997 .