Sciweavers

4411 search results - page 185 / 883
» Communication Complexity and Its Applications
Sort
View
NOCS
2007
IEEE
15 years 11 months ago
Implementing DSP Algorithms with On-Chip Networks
Many DSP algorithms are very computationally intensive. They are typically implemented using an ensemble of processing elements (PEs) operating in parallel. The results from PEs n...
Xiang Wu, Tamer Ragheb, Adnan Aziz, Yehia Massoud
IAT
2006
IEEE
15 years 11 months ago
A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
Terence H.-W. Law, Adrian R. Pearce
APN
2010
Springer
15 years 9 months ago
Wendy: A Tool to Synthesize Partners for Services
Service-oriented computing proposes services as building blocks which can be composed to complex systems. To reason about the correctness of a service, its communication protocol n...
Niels Lohmann, Daniela Weinberg
CLUSTER
2001
IEEE
15 years 8 months ago
A Distributed Object Model for Solving Irregularly Structured Problems on Cluster
This paper presents a distributed object model MOIDE for solving irregularly structured problems on cluster. The primary appeal of MOIDE is its flexible system structure that is a...
Yudong Sun, Cho-Li Wang
PIMRC
2008
IEEE
15 years 11 months ago
Algorithmic aspects of radio flexibility
—This review article explores the notion of radio flexibility, its various versions (as presented in a brief taxonomy) and its efficient instantiations under various metrics, pri...
Andreas Polydoros