Sciweavers

1923 search results - page 245 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ATAL
2007
Springer
15 years 4 months ago
Normative system games
We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic ...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
DIALM
2010
ACM
194views Algorithms» more  DIALM 2010»
14 years 8 months ago
Prioritized gossip in vehicular networks
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
Alejandro Cornejo, Calvin C. Newport
JAIR
2010
82views more  JAIR 2010»
14 years 8 months ago
Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints
Coalitional games serve the purpose of modeling payoff distribution problems in scenarios where agents can collaborate by forming coalitions in order to obtain higher worths than...
Gianluigi Greco, Enrico Malizia, Luigi Palopoli, F...
CVPR
2007
IEEE
15 years 12 months ago
Metropolis-Hasting techniques for finite-element-based registration
In this paper, we focus on the design of Markov Chain Monte Carlo techniques in a statistical registration framework based on finite element basis (FE). Due to the use of FE basis...
Adeline M. M. Samson, Frédéric J. P....
PODC
2010
ACM
14 years 10 months ago
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
Robert Danek