Sciweavers

1923 search results - page 354 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
JAIR
2010
160views more  JAIR 2010»
14 years 8 months ago
Reasoning About the Transfer of Control
We present DCL-PC: a logic for reasoning about how the abilities of agents and coalitions of agents are altered by transferring control from one agent to another. The logical foun...
Wiebe van der Hoek, Dirk Walther, Michael Wooldrid...
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
13 years 3 days ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
104
Voted
ATAL
2009
Springer
15 years 4 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
CCGRID
2005
IEEE
15 years 3 months ago
Performance evaluation of JXTA communication layers
— The arrival of the P2P model has opened many new avenues for research within the field of distributed computing. This is mainly due to important practical features (such as su...
Gabriel Antoniu, Philip J. Hatcher, Mathieu Jan, D...
SPAA
2010
ACM
15 years 2 months ago
Towards optimizing energy costs of algorithms for shared memory architectures
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
Vijay Anand Korthikanti, Gul Agha