Aarts, Emile, Jan Karel Lenstra. 1997. Local Search in Combinatorial Optimization. John Wiley and sons[More][Bibtex][RIS][MODS]
Galinier, Philippe, Jin-Kao Hao. 1997. Tabu Search for Maximal Constraint Satisfaction
Problems. In Principles and Practice of Constraint Programming -
CP'97. LNCS.[More][Bibtex][RIS][MODS]
Schiex, T., Fargier, H., G. Verfaillie. 1997. Problèmes de satisfaction de contraintes
valués. Revue d'Intelligence Artificielle 9(3): 339-373.[More][Bibtex][RIS][MODS]
A. Bellicha. 1996. Flexibilité dans les problèmes de satisfaction
de contraintes. Thèse de doctorat, Université de Montpellier~II, Sciences et
techniques du Languedoc.[More][Bibtex][RIS][MODS]
Bistarelli, S. and others. 1996. Semiring-based CSPs and Valued CSPs: Basic Properties
and Comparison In Over-Constrained Systems, 111-150. Springer Verlag.[More][Bibtex][RIS][MODS]
Dago, P., G. Verfaillie. 1996. Nogood Recording for Valued Constraint Satisfaction
Problems. In Proc. of ICTAI'96. Toulouse, France.[More][Bibtex][RIS][MODS]
Rina Dechter. 1996. Topological parameters for time-space tradeoff. In Prec. of the 4$^th$ international symposium on
Artificial Intelligence and Mathematics. Fort Lauderdale, Florida, January.[More][Bibtex][RIS][MODS]
Fargier, H., Lang, J., T. Schiex. 1996. Mixed Constraint Satisfaction: a framework for
decision problems under incomplete knowledge. In aaai96p. aaai96l : AAAI Press, August.[More][Bibtex][RIS][MODS]
Freuder, Eugene C., Charles D. Elfe. 1996. Neighborhood Inverse Consistency Preprocessing. In aaai96p. aaai96l, August.[More][Bibtex][RIS][MODS]
Jaakkola, T., M. Jordan. 1996. Recursive algorithms for approximating probabilities in graphical models. In Advances in Neural Information Processing Systems (NIPS 9).[More][Online version][Bibtex][RIS][MODS]
Larrosa, J., P. Meseguer. 1996. Exploiting the use of DAC in Max-CSP. In Proc. of CP'96. Boston (MA).[More][Bibtex][RIS][MODS]
Verfaillie, G., Lema^itre, M., T. Schiex. 1996. Russian Doll Search. In aaai96p. aaai96l.[More][Bibtex][RIS][MODS]
R. Wallace. 1996. Analysis of Heuristic Methods for Partial
Constraint Satisfaction Problems. In Proc. of the 2nd International Conference on
Principles and Practice of Constraint Programming
(CP-96), LNCS 1118. Cambridge, MA.[More][Bibtex][RIS][MODS]
R. Wallace. 1996. Enhancements of Branch and Bound Methods for the
Maximal Constraint Satisfaction Problem. In aaai96p. aaai96l : AAAI Press/MIT Press.[More][Bibtex][RIS][MODS]
J. Zhang. 1996. The application of the Gibbs-Bogoliubov-Feynman inequality
in mean field calculations for Markov random fields. IEEE Transactions on Image Processing 5(7): 1208-1214.[More][Bibtex][RIS][MODS]
Year: 1995
P. Barth. 1995. A Davis-Putnam based Enumeration Algorithm for Linear Pseudo-Boolean Optimization. Max-Planck Institut Für Informatik.[More][Bibtex][RIS][MODS]
Bayardo, Roberto, Daniel Miranker. 1995. On the Space-Time Trade-off in Solving Constraint
Satisfaction Problems. In ijcai95p. ijcai95l.[More][Bibtex][RIS][MODS]
Pierre Berlandier. 1995. Filtrage de problèmes par consistance de chemin
restreinte. Revue d'Intelligence Artificielle 9(3): 225-238.[More][Bibtex][RIS][MODS]
Bistarelli, S., Montanari, U., F. Rossi. 1995. Constraint Solving over Semirings. In ijcai95p. ijcai95l, August.[More][Bibtex][RIS][MODS]
Bodlaender, Hans L. and others. 1995. Approximating Treewidth, Pathwidth, Frontsize, and
Shortest Elimination Tree. Journal of Algorithms 18: 238-255.[More][Bibtex][RIS][MODS]
Fargier, H. and others. 1995. A constraint satisfaction framework for decision under uncertainty. In Proc. of the 11$^th$ Int. Conf. on Uncertainty in Artificial Intelligence. Montréal, Canada, August.[More][Bibtex][RIS][MODS]
Jégou, Philippe, Fabrice Bouquet. 1995. Solving Over-constrained CSP using weighted OBDD. In Proceedings of the CP'95 Workshop on Over-Constrained
Systems. Cassis, France, September.[More][Bibtex][RIS][MODS]
Martin-Clouaire, R., J-P. Rellier. 1995. Crop Management Planning as a Fuzzy and Uncertain
Constraint Satisfaction Problem. AI Applications: Natural Resources, Agriculture, and
Environmental Science 9(1).[More][Bibtex][RIS][MODS]
Schiex, T., Fargier, H., G. Verfaillie. 1995. Valued Constraint Satisfaction Problems: hard and easy
problems. In ijcai95p. ijcai95l, August.[More][Bibtex][RIS][MODS]