Sciweavers

13621 search results - page 363 / 2725
» Computability and Complexity in Self-assembly
Sort
View
DAC
2007
ACM
16 years 7 months ago
Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs
A key step in the design of cyclo-static real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure, which means that tasks...
Maarten Wiggers, Marco Bekooij, Gerard J. M. Smit
PODS
2006
ACM
96views Database» more  PODS 2006»
16 years 7 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
FCCM
2005
IEEE
107views VLSI» more  FCCM 2005»
16 years 12 days ago
Simplifying the Integration of Processing Elements in Computing Systems Using a Programmable Controller
As technology sizes decrease and die area increases, designers are creating increasingly complex computing systems using FPGAs. To reduce design time for new products, the reuse o...
Lesley Shannon, Paul Chow
ICALT
2005
IEEE
16 years 12 days ago
Learning Units Design Based in Grid Computing
: The development of cooperative, flexible and reusable learning environments is a need in modern education. The IMS Learning Design specification has played a very important role ...
Leonel Iriarte Navarro, Manuel Marco Such, Alexand...
ISCIS
2005
Springer
16 years 9 days ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy