Sciweavers

13457 search results - page 21 / 2692
» Can we elect if we cannot compare
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Copeland voting: ties matter
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...
Piotr Faliszewski, Edith Hemaspaandra, Henning Sch...
CCS
2010
ACM
13 years 7 months ago
Security analysis of India's electronic voting machines
Elections in India are conducted almost exclusively using electronic voting machines developed over the past two decades by a pair of government-owned companies. These devices, kn...
Scott Wolchok, Eric Wustrow, J. Alex Halderman, Ha...
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
Tal Moran, Moni Naor
IJCSA
2007
116views more  IJCSA 2007»
13 years 7 months ago
What Enterprise Architecture and Enterprise Systems Usage Can and Can not Tell about Each Other
—There is an increased awareness of the roles that enterprise architecture (EA) and enterprise systems (ES) play in today’s organizations. EA and ES usage maturity models are u...
Maya Daneva, Pascal van Eck
EUROPAR
2008
Springer
13 years 9 months ago
DGSim: Comparing Grid Resource Management Architectures through Trace-Based Simulation
Abstract. Many advances in grid resource management are still required to realize the grid computing vision of the integration of a worldwide computing infrastructure for scientifi...
Alexandru Iosup, Omer Ozan Sonmez, Dick H. J. Epem...