2474 search results - page 235 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
190
click to vote
AGP
1996
IEEE
15 years 10 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
226
click to vote
ICLP
2003
Springer
15 years 11 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
157
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
This work presents the architecture of PROSIDIS, a special purpose processor designed to search for the occurrence of substrings similar to a given ‘template string’ within a ...
147
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
188
click to vote
TC
2008
15 years 6 months ago
2008
To support dynamic address translation in today's microprocessors, the first-level cache is accessed in parallel with a translation lookaside buffer (TLB). However, this curre...