Sciweavers

3946 search results - page 2 / 790
» The computational complexity of choice sets
Sort
View
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
13 years 9 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
IJCNN
2006
IEEE
13 years 11 months ago
Sparse Bayesian Models: Bankruptcy-Predictors of Choice?
Abstract— Making inferences and choosing appropriate responses based on incomplete, uncertainty and noisy data is challenging in financial settings particularly in bankruptcy de...
Bernardete Ribeiro, Armando Vieira, João Ca...
FOIKS
2004
Springer
13 years 10 months ago
Implementing Ordered Choice Logic Programming using Answer Set Solvers
Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This com...
Marina De Vos
IR
2002
13 years 4 months ago
An Empirical Analysis of Design Choices in Neighborhood-Based Collaborative Filtering Algorithms
Collaborative filtering systems predict a user's interest in new items based on the recommendations of other people with similar interests. Instead of performing content index...
Jonathan L. Herlocker, Joseph A. Konstan, John Rie...