Sciweavers

2555 search results - page 126 / 511
» Quantifiers and Working Memory
Sort
View
120
Voted
WMPI
2004
ACM
15 years 9 months ago
A localizing directory coherence protocol
User-controllable coherence revives the idea of cooperation between software and hardware in an attempt to bridge the gap between efficient small-scale shared memory machines and m...
Collin McCurdy, Charles N. Fischer
119
Voted
ICPP
1999
IEEE
15 years 7 months ago
Efficient Techniques for Distributed Implementation of Search-Based AI Systems
We study the problem of exploiting parallelism from search-based AI systems on distributed machines. We propose stack-splitting, a technique for implementing orparallelism, which ...
Gopal Gupta, Enrico Pontelli
126
Voted
WDAG
1998
Springer
107views Algorithms» more  WDAG 1998»
15 years 7 months ago
Transient Fault Detectors
We present fault detectors for transient faults, (i.e. corruptions of the memory of the processors, but not of the code of the processors). We distinguish fault detectors for tasks...
Joffroy Beauquier, Sylvie Delaët, Shlomi Dole...
SPDP
1993
IEEE
15 years 7 months ago
The Meerkat Multicomputer
Meerkat is a distributed memory multicomputer architecture that scales to hundreds of processors. Meerkat uses a two dimensional passive backplane to connect nodes composed of pro...
Robert C. Bedichek, Curtis Brown
112
Voted
ICLP
1993
Springer
15 years 7 months ago
On Copy Avoidance in Single Assignment Languages
: Copy avoidance refers to the safe replacement, at compile time, of copying operations by destructive updates in single-assignment languages. Conceptually, the problem can be divi...
Saumya K. Debray