Home Biblio



Year: 2006

  • Cohen, D A. and others. 2006. The complexity of soft constraint satisfaction. Artificial Intelligence 170(11): 983 - 1016. [More] [Bibtex] [RIS] [MODS]
  • Cooper, M. and others. 2006. Soft arc consistency applied to optimal planning. In Proc. of CP'06. LNCS. Nantes, France : Springer. [More] [Bibtex] [RIS] [MODS]
  • Heras, F., J. Larrosa. 2006. New Inference Rules for Efficient Max-SAT Solving. In Proc. of the National Conference on Artificial Intelligence, AAAI-2006. [More] [Bibtex] [RIS] [MODS]
  • Meseguer, P., Rossi, F., T. Schiex. 2006. Soft Constraints Processing In Handbook of Constraint Programming. Elsevier. [More] [Online version] [Bibtex] [RIS] [MODS]
  • Wainwright, Martin J., Martin I. Jordan. 2006. Log-Determinant Relaxation for Approximate Inference in Discrete Markov Random Fields. IEEE Transactions on Signal Processing: 2099-2109. [More] [Online version] [Bibtex] [RIS] [MODS]
  • De Givry, S., Schiex, T., G. Verfaillie. 2006. Exploiting Tree Decomposition and Soft Local Consistency in Weighted CSP. In Proc. of the National Conference on Artificial Intelligence, AAAI-2006. [More] [Bibtex] [RIS] [MODS]

Year: 2005

  • M C. Cooper. 2005. High-Order Consistency in Valued Constraint Satisfaction. Constraints 10: 283-305. [More] [Bibtex] [RIS] [MODS]
  • Kask, K. and others. 2005. Unifying Cluster-Tree Decompositions for Reasoning in Graphical models. Artificial Intelligence 166(1-2): 165-193. [More] [Bibtex] [RIS] [MODS]
  • Larrosa, J., F. Heras. 2005. Resolution in Max-SAT and its relation to local consistency in weighted CSPs. In ijcai05p. ijcai05l. [More] [Bibtex] [RIS] [MODS]
  • Larrosa, J. and others. 2005. Existential arc consistency: getting closer to full arc consistency in weighted CSPs. In ijcai05p. ijcai05l, August. [More] [Bibtex] [RIS] [MODS]
  • Li, C M., Manyà, F., J. Planes. 2005. Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. In Proc of CP'2005. LNCS. Sitges, Spain. [More] [Bibtex] [RIS] [MODS]
  • Wainwright, M J, Jaakkola, Tommi S, Alan S Willsky. 2005. A New Class of Upper Bounds on the Log Partition Function. IEEE Transactions on Information Theory 51(7): 2313-2335. [More] [Online version] [Bibtex] [RIS] [MODS]
  • Yedidia, J. S., Freeman, W. T., Y. Weiss. 2005. Constructing free-energy approximations and generalized belief propagation algorithms. Information Theory, IEEE Transactions on 51(7): 2282-2312. [More] [Online version] [Bibtex] [RIS] [MODS]
  • De Givry, S. and others. 2005. Mendelian error detection in complex pedigree using weighted constraint satisfaction techniques. In Proc. of ICLP-05 workshop on Constraint Based Methods for Bioinformatics. Sitges, Spain. [More] [Bibtex] [RIS] [MODS]

Year: 2004

  • Cohen, D A. and others. 2004. A Maximal Tractable Class of Soft Constraints. Journal of Artificial Intelligence Research 22: 1-22. [More] [Bibtex] [RIS] [MODS]
  • Cooper, M C., T. Schiex. 2004. Arc consistency for soft constraints. ai 154(1-2): 199-227. [More] [Bibtex] [RIS] [MODS]
  • Park, J. D., A. Darwiche. 2004. Complexity results and Approximation Strategies for MAP explanations. Journal of Artificial Intelligence Research 21: 101-133. [More] [Bibtex] [RIS] [MODS]
  • Reeves, R., A. N. Pettitt. 2004. Efficient recursions for general factorisable models. Biometrika 91(3): 751-757. [More] [Online version] [Bibtex] [RIS] [MODS]
  • S. De Givry. 2004. Singleton consistency and dominance rules in weighted CSPs. In CP-04 Workshop on Preferences and Soft Constraints. Toronto, Canada. [More] [Bibtex] [RIS] [MODS]

Year: 2003

  • Bennaceur, H., A. Osmani. 2003. Computing lower bounds for Max-CSP problems In Developments in Applied Artificial Intelligence, 217-240. Springer. [More] [Bibtex] [RIS] [MODS]
  • Larrosa, J., T. Schiex. 2003. In the quest of the best form of local consistency for Weighted CSP. In ijcai03p. ijcai03l, August. [More] [Bibtex] [RIS] [MODS]
  • Leisink, M., B. Kappen. 2003. Bound Propagation. Journal of Artificial Intelligence Research 19: 139-154. [More] [Online version] [Bibtex] [RIS] [MODS]
  • Pettitt, A. N., Friel, N., R. Reeves. 2003. Efficient calculation of the normalizing constant of the autologistic and related models on the cylinder and lattice. Royal Statistical Society Journal: Series B (Statistical Methodology) 65(1): 235-246. [More] [Online version] [Bibtex] [RIS] [MODS]
  • Rangan, A., W. Zhang. 2003. Backbone Guided Local Search for Maximum Satisfiability. In ijcai03p. Acapulco, Mexico, August. [More] [Bibtex] [RIS] [MODS]
  • De Givry, Simon and others. 2003. Solving Max-Sat as weighted CSP. In Proc. of the Ninth International Conference on Principles and Practice of Constraint Programming. LNCS. Kinsale, Ireland : Springer Verlag, October. [More] [Bibtex] [RIS] [MODS]
Results 26 - 50 of 208
<< Start < Prev 1 2 3 4 5 6 7 8 9 Next > End >>
English (United Kingdom)