Sciweavers

1260 search results - page 19 / 252
» Bipolar Preference Problems
Sort
View
ICML
1998
IEEE
14 years 10 months ago
An Efficient Boosting Algorithm for Combining Preferences
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...
AAAI
1994
13 years 11 months ago
Case-Based Acquisition of User Preferences for Solution Improvement in Ill-Structured Domains
1 We have developed an approach to acquire complicated user optimization criteria and use them to guide iterative solution improvement. The eectiveness of the approach was tested ...
Katia P. Sycara, Kazuo Miyashita
ACID
2006
239views Algorithms» more  ACID 2006»
13 years 11 months ago
Stable Marriage with Ties and Bounded Length Preference Lists
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
Robert W. Irving, David Manlove, Gregg O'Malley
ALGORITHMICA
2010
192views more  ALGORITHMICA 2010»
13 years 10 months ago
Circular Stable Matching and 3-way Kidney Transplant
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...
Chien-Chung Huang
SARA
2005
Springer
14 years 3 months ago
Approximate Model-Based Diagnosis Using Preference-Based Compilation
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
Gregory M. Provan