152 search results - page 24 / 31 » An Information-Theoretic Model of Voting Systems |
ACISP
2001
Springer
14 years 10 days ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
BMCBI
2008
13 years 8 months ago
2008
Background: Occult organizational structures in DNA sequences may hold the key to understanding functional and evolutionary aspects of the DNA molecule. Such structures can also p...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—The capacity of today’s cellular mobile communications systems is mainly limited by inter-cell interference. Multi-cell joint transmission or joint detection schemes a...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...