Sciweavers

1260 search results - page 110 / 252
» Bipolar Preference Problems
Sort
View
LPAR
2010
Springer
14 years 8 months ago
A Syntactical Approach to Qualitative Constraint Networks Merging
We address the problem of merging qualitative constraint networks (QCNs) representing agents local preferences or beliefs on the relative position of spatial or temporal entities. ...
Jean-François Condotta, Souhila Kaci, Pierr...
ICWS
2009
IEEE
14 years 7 months ago
Discovery of Optimized Web Service Configurations Using a Hybrid Semantic and Statistical Approach
We present a Semantic Optimized Service Discovery (SemOSD) approach capable of handling Web service search requests on a fine-grained level of detail where we augment semantic ser...
Maciej Zaremba, Jacek Migdal, Manfred Hauswirth
CDC
2010
IEEE
106views Control Systems» more  CDC 2010»
14 years 5 months ago
Observational learning in an uncertain world
We study a model of observational learning in social networks in the presence of uncertainty about agents' type distributions. Each individual receives a private noisy signal ...
Daron Acemoglu, Munther A. Dahleh, Asuman E. Ozdag...
JMLR
2010
135views more  JMLR 2010»
14 years 4 months ago
An Exponential Model for Infinite Rankings
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker will then typically r...
Marina Meila, Le Bao
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
15 years 10 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin