Home Biblio



Year: 1999

  • Affane, M. S., Bennaceur, H., T. Schiex. 1999. Comparaison de deux minorants paramétriques pour Max-CSP. In Actes de JNPC'99. [More] [Bibtex] [RIS] [MODS]
  • Bensana, Eric, Lema^itre, Michel, Gérard Verfaillie. 1999. Earth Observation Satellite Management. Constraints 4(3): 293-299. [More] [Bibtex] [RIS] [MODS]
  • Bistarelli, S. and others. 1999. Semiring-based CSPs and Valued CSPs: Frameworks, Properties and Comparison. Constraints 4: 199-240. [More] [Bibtex] [RIS] [MODS]
  • Borchers, B., J. Furman. 1999. A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems. Journal of Combinatorial Optimization 2(4): 299-306. [More] [Bibtex] [RIS] [MODS]
  • Cabon, B. and others. 1999. Radio Link Frequency Assignment. Constraints 4: 79-89. [More] [Bibtex] [RIS] [MODS]
  • Rina Dechter. 1999. Bucket Elimination: A Unifying Framework for Reasoning. Artificial Intelligence 113(1--2): 41-85. [More] [Bibtex] [RIS] [MODS]
  • A M C A. Koster. 1999. Frequency assignment: Models and Algorithms, University of Maastricht, November. [More] [Bibtex] [RIS] [MODS]
  • Koster, A. M. C. A, Van Hoesel, S.P.M, A. W. J. Kolen. 1999. Solving Frequency Assignment Problems via Tree-Decomposition. Maastricht, The Netherlands : Universiteit Maastricht. [More] [Bibtex] [RIS] [MODS]
  • Larrosa, J., P. Meseguer. 1999. Partition-Based Lower Bound for Max-CSP. In Proc. of the 5$^th$ International Conference on Principles and Practice of Constraint Programming (CP-99). [More] [Bibtex] [RIS] [MODS]
  • Larrosa, J., Meseguer, P., T. Schiex. 1999. Maintaining Reversible DAC for Max-CSP. ai 107(1): 149-163. [More] [Bibtex] [RIS] [MODS]
  • Wu, Zhe, Benjamin W. Wah. 1999. Trap Escaping Strategies in Discrete Lagrangian Methods for Solving Hard Satisfiability and Maximum Satisfiability Problems. In aaai99p. aaai99l. [More] [Bibtex] [RIS] [MODS]

Year: 1998

  • Affane, M. S., H. Bennaceur. 1998. A weighted arc consistency technique for Max-CSP. In ecai98p. ecai98l. [More] [Bibtex] [RIS] [MODS]
  • Cabon, B., De Givry, S., G. Verfaillie. 1998. Anytime Lower Bounds for Constraint Violation Minimization Problems. In Proc. of the 4th International Conference on Principles and Practice of Constraint Programming (CP-98). Pisa, Italy. [More] [Bibtex] [RIS] [MODS]
  • Larrosa, J., P. Meseguer. 1998. Partial Lazy Forward Checking for MAX-CSP. In ecai98p. ecai98l. [More] [Bibtex] [RIS] [MODS]
  • Larrosa, J. and others. 1998. Reversible DAC and Other Improvements for Solving Max-CSP. In aaai98p. aaai98l, July. [More] [Bibtex] [RIS] [MODS]
  • T. Schiex. 1998. Maximizing the reversible DAC lower bound in Max-CSP is textsfNP-hard. INRA, July. [More] [Bibtex] [RIS] [MODS]

Year: 1997

  • Bistarelli, S., Montanari, U., F. Rossi. 1997. Semiring based constraint solving and Optimization. Journal of the ACM 44(2): 201-236. [More] [Bibtex] [RIS] [MODS]
  • Borchers, B., Mitchell, J. E., S. Joy. 1997. A Branch-And-Cut Algorithm for MAX-SAT and weighted MAX-SAT In Satisfiability Problem: Theory and Applications, 519-536. AMS. [More] [Bibtex] [RIS] [MODS]
  • Debruyne, Romuald, Christian Bessière. 1997. From Restricted Path Consistency to Max-Restricted Path Consistency. In Proc. of CP'97. LNCS. Linz, Austria : Springer-Verlag, November. [More] [Bibtex] [RIS] [MODS]
  • Rina Dechter. 1997. Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning. In IJCAI. [More] [Bibtex] [RIS] [MODS]
  • Fargier, Hélène and others. 1997. Traitement de problèmes de décision sous incertitude par des problèmes de satisfaction de contraintes. Revue d'Intelligence Artificielle 11(3): 375-398. [More] [Bibtex] [RIS] [MODS]
  • Potamianos, G., J. Goutsias. 1997. Stochastic approximation algorithms for partition function estimation of Gibbs random fields. IEEE Transactions on Information Theory 43(6): 1948-1965. [More] [Online version] [Bibtex] [RIS] [MODS]
  • Resende, M. G. C., Pitsoulis, L. S., P. M. Pardalos. 1997. Approximate solution of weighted MAX-SAT problems using GRASP. In Satisfiability problem: Theory and Applications, 393-405. AMS. [More] [Bibtex] [RIS] [MODS]
  • Wah, Benjamin W., Yi Shang. 1997. Discrete Lagrangian-Based Search for Solving MAX-SAT Problems. In ijcai97p. ijcai97l. [More] [Bibtex] [RIS] [MODS]
  • De Givry, Simon, Verfaillie, Gérard, Thomas Schiex. 1997. Bounding the Optimum of Constraint Optimization Problems. In Proc. of the Third International Conference on Principles and Practice of Constraint Programming. Schloss Hagenberg, Austria, October. [More] [Bibtex] [RIS] [MODS]
Results 76 - 100 of 208
<< Start < Prev 1 2 3 4 5 6 7 8 9 Next > End >>
English (United Kingdom)