Sciweavers

11561 search results - page 434 / 2313
» Open Distributed Processing
Sort
View
PODC
2006
ACM
16 years 1 months ago
Stably computable predicates are semilinear
We consider the model of population protocols introduced by Angluin et al. [2], in which anonymous finite-state agents stably compute a predicate of their inputs via twoway inter...
Dana Angluin, James Aspnes, David Eisenstat
189
Voted
IPPS
2002
IEEE
16 years 12 days ago
On Cost-Optimal Merge of Two Intransitive Sorted Sequences
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
Jie Wu, Stephan Olariu
AAIM
2009
Springer
172views Algorithms» more  AAIM 2009»
16 years 3 days ago
PLDA: Parallel Latent Dirichlet Allocation for Large-Scale Applications
Abstract. This paper presents PLDA, our parallel implementation of Latent Dirichlet Allocation on MPI and MapReduce. PLDA smooths out storage and computation bottlenecks and provid...
Yi Wang, Hongjie Bai, Matt Stanton, Wen-Yen Chen, ...
EUMAS
2006
15 years 8 months ago
Friends No More: Ostracism in Multi-Agent Systems
In a normative society there are two main problems: defining norms and enforcing them. Enforcement becomes a complex issue as societies become more decentralized and open. We propo...
Adrian Perreau de Pinninck, Carles Sierra, W. Marc...
203
Voted
IEEEPACT
2009
IEEE
15 years 5 months ago
Core-Selectability in Chip Multiprocessors
Abstract--The centralized structures necessary for the extraction of instruction-level parallelism (ILP) are consuming progressively smaller portions of the total die area of chip ...
Hashem Hashemi Najaf-abadi, Niket Kumar Choudhary,...