Home Biblio



Year: 2003

  • M C. Cooper. 2003. Reduction operations in fuzzy or valued constraint satisfaction. Fuzzy Sets and Systems 134(3): 311-342. [More] [Bibtex] [RIS] [MODS]
  • De Givry, S. and others. 2003. The SoftCSP and Max-SAT benchmarks and algorithm web site.. textsfcarlit.toulouse.inra.fr/cgi-bin/awki.cgi/softcsp. [More] [Bibtex] [RIS] [MODS]

Year: 2002

  • Aloul, F. and others. 2002. PBS: A Backtrack-Search Pseudo-Boolean Solver and Optimizer. In Symposium on the Theory and Applications of Satisfiability Testing (SAT). Cincinnati, (OH). [More] [Bibtex] [RIS] [MODS]
  • Auriac, J-Ch Angles D and others. 2002. Optimal Cooperation and Submodularity for Computing Potts Partition Functions with a Large Number of State: 18. [More] [Online version] [Bibtex] [RIS] [MODS]
  • Bartolucci, F., J. Besag. 2002. A recursive algorithm for Markov random fields. Biometrika: 724-730. [More] [Online version] [Bibtex] [RIS] [MODS]
  • Boros, E., P. Hammer. 2002. Pseudo-Boolean Optimization. Discrete Appl. Math. 123: 155-225. [More] [Bibtex] [RIS] [MODS]
  • Dixon, H., M. Ginsberg. 2002. Inference methods for a pseudo-boolean satisfiability solver. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02). [More] [Bibtex] [RIS] [MODS]
  • J. Larrosa. 2002. On Arc and Node Consistency in weighted CSP. In Proc. AAAI'02. Edmondton, (CA). [More] [Bibtex] [RIS] [MODS]
  • Xu, H., Rutenbar, R. A., K. Sakallah. 2002. sub-SAT: A Formulation for Relaxed Boolean Satisfiability with Applications in Routing. In Proc. Int. Symp. on Physical Design. San Diego (CA), April. [More] [Bibtex] [RIS] [MODS]

Year: 2001

  • Bistarelli, S., Gennari, R., F. Rossi. 2001. General Properties and Termination Conditions for Soft Constraint Propagation. Constraints: An International Journal 8(1). [More] [Bibtex] [RIS] [MODS]
  • Lau, T. L., P. K. Tsang. 2001. Guided genetic algorithm and its application to radio link frequency assignment problems. Constraints 6(4): 373-398. [More] [Bibtex] [RIS] [MODS]
  • Leisink, M., B. Kappen. 2001. A tighter bound for graphical models. In NIPS 2000. Neural Information Processing System. [More] [Online version] [Bibtex] [RIS] [MODS]
  • N. Peyrard. 2001. Approximations de type champ moyen des modèles de champ de Markov pour la segmentation de données spatiales. [More] [Bibtex] [RIS] [MODS]
  • Régin, J-C. and others. 2001. New Lower Bounds of Constraint Violations for Over-Constrained Problems. In Proc. of CP'2001. LNCS. Paphos, Cyprus, December. [More] [Bibtex] [RIS] [MODS]

Year: 2000

  • Biso, Alessandro, Rossi, Francesca, Alessandro Sperduti. 2000. Experimental Results on Learning Soft Constraints. In KR2000: Principles of Knowledge Representation and Reasoning, ed. Cohn, Anthony G., Giunchiglia, Fausto, Selman, Bart. San Francisco : Morgan Kaufmann. [More] [Bibtex] [RIS] [MODS]
  • Bistarelli, S., Gennari, R, F. Rossi. 2000. Constraint propagation for Soft Constraints: generalizationand Termination conditions. In Principles and Practice of Constraint Programming - CP 2000. LNCS. Singapore, September. [More] [Bibtex] [RIS] [MODS]
  • Gramm, J., R. Niedermeier. 2000. Faster exact solutions for Max2Sat. In Proceedings of the 4th Italian Conference on Algorithms and Complexity, ed. Bongiovanni, G., Gambosi, G., Petreschi, R.. LNCS. Rome, Italy : Springer, March. [More] [Bibtex] [RIS] [MODS]
  • Gramm, J. and others. 2000. New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT. Electronic Colloquium on Computational Complexity. [More] [Bibtex] [RIS] [MODS]
  • Horsch, Micheal C., William S. Havens. 2000. An Empirical Study of Probabilistic Arc Consistency as a Variable Ordering. In Principles and Practice of Constraint Programming - CP 2000. LNCS. Singapore, September. [More] [Bibtex] [RIS] [MODS]
  • J. Larrosa. 2000. Boosting search with variable elimination. In Principles and Practice of Constraint Programming - CP 2000. LNCS. Singapore, September. [More] [Bibtex] [RIS] [MODS]
  • Larrosa, J., R. Dechter. 2000. On the Dual Representation of non-Binary Semiring-based CSPs. CP'2000 Workshop on Soft Constraints, October. [More] [Bibtex] [RIS] [MODS]
  • Mills, P., E. Tsang. 2000. Guided local search for solving SAT and weighted MAX-SAT problems. In SAT2000 --- Highlights of Satisfiability Research in the Year 2000, ed. Gent, I. P., Van Maaren, H., Walsh, T.. IOS Press, Amsterdam. [More] [Bibtex] [RIS] [MODS]
  • Petit, T., Régin, J. C., C. Bessière. 2000. Meta constraints on violations for over constrained problems. In Proceedings of IEEE ICTAI'2000. Vancouver, BC, Canada. [More] [Bibtex] [RIS] [MODS]
  • T. Schiex. 2000. Arc consistency for soft constraints. In Principles and Practice of Constraint Programming - CP 2000. LNCS. Singapore, September. [More] [Bibtex] [RIS] [MODS]
  • T. Schiex. 2000. Arc cohérence pour contraintes molles. In Actes de JNPC'00. Marseille, June. [More] [Bibtex] [RIS] [MODS]
Results 51 - 75 of 208
<< Start < Prev 1 2 3 4 5 6 7 8 9 Next > End >>
English (United Kingdom)