266 search results - page 15 / 54 » Can Saturation Be Parallelised |
117
click to vote
ICPP
2003
IEEE
15 years 8 months ago
2003
IEEE
The bus that connects processors to memory is known to be a major architectural bottleneck in SMPs. However, both software and scheduling policies for these systems generally focu...
108
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
We propose a camera that measures static gradients instead of static intensities. Quantizing sensed intensity differences between adjacent pixel values permits an ordinary A/D con...
121
click to vote
DAC
2008
ACM
16 years 4 months ago
2008
ACM
In this paper we present a reconfigurable routing algorithm for a 2D-Mesh Network-on-Chip (NoC) dedicated to faulttolerant, Massively Parallel Multi-Processors Systems on Chip (MP...
126
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
130
click to vote
CP
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. Existing constraint programming systems offer a fixed set of inference engines implementing search strategies such as single, all, and best solution search. This is unfo...