Sciweavers

272 search results - page 15 / 55
» Communicating sequential processes for distributed constrain...
Sort
View
ATAL
2005
Springer
15 years 3 months ago
A polynomial algorithm for decentralized Markov decision processes with temporal constraints
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
Aurélie Beynier, Abdel-Illah Mouaddib
CASCON
1997
85views Education» more  CASCON 1997»
14 years 11 months ago
Fast detection of communication patterns in distributed executions
Understanding distributed applications is a tedious and di cult task. Visualizations based on process-time diagrams are often used to obtain a better understanding of the executio...
Thomas Kunz, Michiel F. H. Seuren
REST
2010
ACM
15 years 1 months ago
A RESTful messaging system for asynchronous distributed processing
Traditionally, distributed computing problems have been solved by partitioning data into chunks able to be handled by commodity hardware. Such partitioning is not possible in case...
Ian Jacobi, Alexey Radul
109
Voted
IPPS
1999
IEEE
15 years 1 months ago
BSP in CSP: Easy as ABC
Abstract. In this paper we describe how the language of Communicating Sequential Processes CSP has been applied to the analysis of a transport layer protocol used in the implementa...
Andrew C. Simpson, Jonathan M. D. Hill, Stephen R....
SIGECOM
2011
ACM
216views ECommerce» more  SIGECOM 2011»
14 years 9 days ago
Strategic sequential voting in multi-issue domains and multiple-election paradoxes
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
Lirong Xia, Vincent Conitzer, Jérôme ...