Sciweavers

4747 search results - page 843 / 950
» Shuffle Memory System
Sort
View
SPAA
1998
ACM
15 years 10 months ago
Fast Set Operations Using Treaps
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
Guy E. Blelloch, Margaret Reid-Miller
PODC
1997
ACM
15 years 10 months ago
Determining Consensus Numbers
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
Eric Ruppert
CIKM
1997
Springer
15 years 10 months ago
A Framework for the Management of Past Experiences with Time-Extended Situations
: In the context of knowledge management, we focus on the representation and the retrieval of past experiences called cases within the Case-Based Reasoning (CBR) paradigm. CBR is a...
Michel Jaczynski
ISPAN
1996
IEEE
15 years 10 months ago
Design and evaluation of an environment APE for automatic parallelization of programs
In this paper, we have presented the design and evaluation of a compiler system, called APE,for automatic parallelization of scientific and engineering applications on distributed...
Vipin Chaudhary, Cheng-Zhong Xu, Sumit Roy, Jialin...
ERCIMDL
1997
Springer
106views Education» more  ERCIMDL 1997»
15 years 10 months ago
Scalable Text Retrieval for Large Digital Libraries
It is argued that digital libraries of the future will contain terabyte-scale collections of digital text and that full-text searching techniques will be required to operate over c...
David Hawking