Sciweavers

207 search results - page 14 / 42
» The complexity of agreement
Sort
View
JCC
2008
114views more  JCC 2008»
14 years 9 months ago
Molecular simulation of multistate peptide dynamics: A comparison between microsecond timescale sampling and multiple shorter tr
Abstract: Molecular dynamics simulations of the RN24 peptide, which includes a diverse set of structurally heterogeneous states, are carried out in explicit solvent. Two approaches...
Luca Monticelli, Eric J. Sorin, D. Peter Tieleman,...
MAGS
2008
121views more  MAGS 2008»
14 years 9 months ago
A decentralized model for automated multi-attribute negotiations with incomplete information and general utility functions
This paper presents a decentralized model that allows self-interested agents to reach "win-win" agreements in a multi-attribute negotiation. The model is based on an alt...
Guoming Lai, Katia P. Sycara, Cuihong Li
AUTOMATICA
2011
14 years 4 months ago
Distributed averaging on digital erasure networks
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
Ruggero Carli, Giacomo Como, Paolo Frasca, Federic...
ICDCS
2007
IEEE
15 years 3 months ago
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
15 years 3 months ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...