Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies

, , , &
Artificial Intelligence 174 (3-4):270-294 (2010)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2009.11.015

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,070

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Experimental evaluation of preprocessing algorithms for constraint satisfaction problems.Rina Dechter & Itay Meiri - 1994 - Artificial Intelligence 68 (2):211-241.
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems.Alan K. Mackworth & Eugene C. Freuder - 1985 - Artificial Intelligence 25 (1):65-74.
Branch and bound algorithms to solve semiring constraint satisfaction problems.Louise Leenen & Aditya Ghose - 2008 - In Tu-Bao Ho & Zhi-Hua Zhou (eds.), PRICAI 2008: Trends in Artificial Intelligence. Springer. pp. 991--997.
On the phase transitions of random k-constraint satisfaction problems.Yun Fan & Jing Shen - 2011 - Artificial Intelligence 175 (3-4):914-927.
分布推定アルゴリズムによる Memetic Algorithms を用いた制約充足問題解決.Handa Hisashi - 2004 - Transactions of the Japanese Society for Artificial Intelligence 19:405-412.
Fundamental properties of neighbourhood substitution in constraint satisfaction problems.Martin C. Cooper - 1997 - Artificial Intelligence 90 (1-2):1-24.
Constraint-based optimization and utility elicitation using the minimax decision criterion.Craig Boutilier, Relu Patrascu, Pascal Poupart & Dale Schuurmans - 2006 - Artificial Intelligence 170 (8-9):686-713.
The complexity of soft constraint satisfaction.David A. Cohen, Martin C. Cooper, Peter G. Jeavons & Andrei A. Krokhin - 2006 - Artificial Intelligence 170 (11):983-1016.
Filtering algorithms for the multiset ordering constraint.Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel & Toby Walsh - 2009 - Artificial Intelligence 173 (2):299-328.
Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks.Weixiong Zhang, Guandong Wang, Zhao Xing & Lars Wittenburg - 2005 - Artificial Intelligence 161 (1-2):55-87.

Analytics

Added to PP
2020-12-22

Downloads
7 (#1,408,163)

6 months
6 (#701,155)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Add more citations

References found in this work

Open constraint programming.Boi Faltings & Santiago Macho-Gonzalez - 2005 - Artificial Intelligence 161 (1-2):181-208.

Add more references