6105 search results - page 1103 / 1221 » A Parallel Algorithm for Bound-Smoothing |
132
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
We study the computational power of a distributed system consisting of simple autonomous robots moving on the plane. The robots are endowed with visual perception but do not have ...
154
click to vote
DAC
2008
ACM
15 years 6 months ago
2008
ACM
The problem attacked in this paper is one of automatically mapping an application onto a Network-on-Chip (NoC) based chip multiprocessor (CMP) architecture in a locality-aware fas...
154
click to vote
DEBS
2008
ACM
15 years 6 months ago
2008
ACM
This paper defines and discusses the implementation of two novel extensions to the Siena Content-based Network (CBN) to extend it to become a Knowledge-based Network (KBN) thereby...
139
click to vote
AAAI
1993
15 years 6 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
156
click to vote
WCE
2007
15 years 6 months ago
2007
—Partitioned global address space (PGAS) languages, such as Unified Parallel C (UPC) have the promise of being productive. Due to the shared address space view that they provide,...