Sciweavers

152 search results - page 10 / 31
» An Information-Theoretic Model of Voting Systems
Sort
View
IANDC
2010
67views more  IANDC 2010»
13 years 6 months ago
Parameterized computational complexity of Dodgson and Young elections
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
Nadja Betzler, Jiong Guo, Rolf Niedermeier
ATAL
2010
Springer
13 years 9 months ago
On the role of distances in defining voting rules
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
IWSOC
2003
IEEE
117views Hardware» more  IWSOC 2003»
14 years 1 months ago
Design Considerations for Optically Connected Systems on Chip
This paper addresses some fundamental issues relating to the design of systems on chip that utilize optical interconnects. We present an information theoretical model for assessin...
Neal K. Bambha, Shuvra S. Bhattacharyya, Gary Euli...
FSS
2008
108views more  FSS 2008»
13 years 7 months ago
A collaborative recommender system based on probabilistic inference from fuzzy observations
The problem of building recommender systems has attracted considerable attention in recent years. The objective of this paper is to automatically suggest and rank a list of new it...
Luis M. de Campos, Juan M. Fernández-Luna, ...
ITRUST
2005
Springer
14 years 1 months ago
Operational Models for Reputation Servers
This paper devises a classification system for reputation systems based on two axes, namely: who performs the evaluation of a subject’s reputation, and how the information is col...
David W. Chadwick