Home Biblio



Year: 1993

  • Dubois, Didier, Fargier, Hélène, Henri Prade. 1993. Using fuzzy constraints in job-shop scheduling. In Proc. of IJCAI-93/SIGMAN Workshop on Knowledge-based Production Planning, Scheduling and Control. Chambery, France, August. [More] [Bibtex] [RIS] [MODS]
  • Dubois, D., Fargier, H., H. Prade. 1993. The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction. In Proc. 2$^nd$ IEEE Conference on Fuzzy Systems. San Francisco, CA, March. [More] [Bibtex] [RIS] [MODS]
  • Dubois, Didier, Fargier, Hélène, Henri Prade. 1993. Propagation and Satisfaction of fuzzy constraints In Fuzzy Sets, Neural Networks and Soft Computing, 166-187. Kluwer Acad.. [More] [Bibtex] [RIS] [MODS]
  • Fargier, H., Lang, J., T. Schiex. 1993. Selecting preferred solutions in Fuzzy Constraint Satisfaction Problems. In Proc. of the 1$^st$ European Congress on Fuzzy and Intelligent Technologies. [More] [Bibtex] [RIS] [MODS]
  • Jerrum, M., A. Sinclair. 1993. Polynomial-time Approximation Algorithms for the Ising Model. SIAM Journal on Computing 22: 1087-1116. [More] [Online version] [Bibtex] [RIS] [MODS]
  • Lefteris M. Kirousis. 1993. Fast parallel constraint satisfaction. ai 64: 147-160. [More] [Bibtex] [RIS] [MODS]
  • Wallace, Richard J., Eugene C. Freuder. 1993. Conjunctive Width Heuristics for Maximal Constraint Satisfaction. In aaai93p. aaai93l. [More] [Bibtex] [RIS] [MODS]
  • Florence Dupin De Saint-Cyr. 1993. Formalisation et applications de la logique des pénalités. Toulouse, FRANCE : I.R.I.T.. [More] [Bibtex] [RIS] [MODS]

Year: 1992

  • Fargier, Hélène, Martin-Clouaire, Roger, Thomas Schiex. 1992. Satisfaction de contraintes souples. In Journées nationales << Les applications des ensembles flous >>. Nîmes, France, October. [More] [Bibtex] [RIS] [MODS]
  • Freuder, E. C., R. J. Wallace. 1992. Partial Constraint Satisfaction. ai 58: 21-70. [More] [Bibtex] [RIS] [MODS]
  • Mark W. Krentel. 1992. Generalizations of sf OptP to the polynomial hierarchy. Theoretical Computer Science 97: 183-198. [More] [Bibtex] [RIS] [MODS]
  • J. W. H. Liu. 1992. The multifrontal method for sparse matrix solution: Theory and practice. SIAM Review 34: 82-109. [More] [Bibtex] [RIS] [MODS]
  • R. Martin-Clouaire. 1992. Dealing with Soft Constraints in a Constraint Satisfaction Problem. In Proc. of the International Conference on Information Processing of Uncertainty in Knowledge based Systems. Palma de Mallorca, July. [More] [Bibtex] [RIS] [MODS]
  • Minton, Steven and others. 1992. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. ai 58: 160-205. [More] [Bibtex] [RIS] [MODS]
  • T. Schiex. 1992. Possibilistic Constraint Satisfaction Problems or ``How to handle soft constraints~?''. In Proc. of the 8$^th$ Int. Conf. on Uncertainty in Artificial Intelligence. Stanford, CA, July. [More] [Bibtex] [RIS] [MODS]

Year: 1991

  • Dubois, Didier, Lang, Jérôme, Henri Prade. 1991. Inconsistency in possibilistic Knowledge bases - to live or not to live with it In Fuzzy logic for the Management of Uncertainty, 335-351. Wiley and sons. [More] [Bibtex] [RIS] [MODS]
  • Eugene C. Freuder. 1991. Eliminating Interchangeable Values in Constraint Satisfaction Problems. In aaai91p. aaai91l. [More] [Bibtex] [RIS] [MODS]
  • Jérôme Lang. 1991. Possibilistic Logic as a Logical Framework for Min-Max Discrete Optimisation Problems and Prioritized Constraints. In FAIR'91. [More] [Bibtex] [RIS] [MODS]
  • Montanari, Ugo, Francesca Rossi. 1991. Perfect Relaxation in Constraint Logic Programming. In Proc. of the $8^th$ international conference on Logic Programming, ed. Furukawa, Koichi. The MIT Press. [More] [Bibtex] [RIS] [MODS]
  • Montanari, Ugo, Francesca Rossi. 1991. Constraint relaxation may be perfect. ai 48: 143-170. [More] [Bibtex] [RIS] [MODS]
  • G. Shafer. 1991. An Axiomatic Study of Computation in Hypertrees. Working paper. Lawrence : University of Kansas, School of Business. [More] [Bibtex] [RIS] [MODS]
  • P. Shenoy. 1991. Valuation-based systems for discrete optimization In Uncertainty in AI. North-Holland Publishers. [More] [Bibtex] [RIS] [MODS]

Year: 1990

  • Dechter, R., Dechter, A., J. Pearl. 1990. Optimization in Constraint Networks In Influence Diagrams, Belief Nets and Decision Analysis, 411-425. John Wiley & Sons Ltd.. [More] [Bibtex] [RIS] [MODS]
  • Hansen, P., B. Jaumard. 1990. Algorithms for the Maximum Satisfiability Problem. Computing 44: 279-303. [More] [Bibtex] [RIS] [MODS]
  • Snow, P., E. C. Freuder. 1990. Improved Relaxation and Search Methods for Approximate Constraint Satisfaction with a Maximin Criterion. In Proc. of the 8$^th$ biennal conf. of the canadian society for comput. studies of intelligence, May. [More] [Bibtex] [RIS] [MODS]
Results 151 - 175 of 208
<< Start < Prev 1 2 3 4 5 6 7 8 9 Next > End >>
English (United Kingdom)