2374 search results - page 97 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
178
click to vote
IPL
2011
14 years 9 months ago
2011
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
172
click to vote
DAC
2000
ACM
15 years 10 months ago
2000
ACM
The decrease in feature size and added chip functionality in large sub-micron integrated circuits demand larger grids for power distribution. Since power grids are performance lim...
169
click to vote
IEEEPACT
1998
IEEE
15 years 10 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
180
click to vote
CF
2008
ACM
15 years 8 months ago
2008
ACM
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
170
click to vote
CF
2005
ACM
15 years 8 months ago
2005
ACM
In this paper we present a new organic computing principle denoted as marching pixels for the architectures of future smart CMOS camera chips. The idea of marching pixels is based...