Sciweavers

2588 search results - page 67 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
ATAL
2008
Springer
15 years 3 months ago
Automated design of scoring rules by learning from examples
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosensc...
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
15 years 7 months ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
15 years 6 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
84
Voted
IPPS
2000
IEEE
15 years 6 months ago
Connectivity Models for Optoelectronic Computing Systems
Abstract. Rent's rule and related concepts of connectivity such as dimensionality, line-length distributions, and separators have found great use in fundamental studies of di ...
Haldun M. Özaktas
IJCNN
2008
IEEE
15 years 8 months ago
Dynamic logic of phenomena and cognition
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...
Boris Kovalerchuk, Leonid I. Perlovsky