Sciweavers

535 search results - page 17 / 107
» Insertion and Expansion Operations for
Sort
View
ADAEUROPE
2003
Springer
15 years 2 months ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney
ISSRE
2002
IEEE
15 years 2 months ago
Mutation of Java Objects
Fault insertion based techniqueshave been used for measuring test adequacy and testability of programs. Mutation analysis inserts faults into a program with the goal of creating m...
Roger T. Alexander, James M. Bieman, Sudipto Ghosh...
CANPC
1998
Springer
15 years 1 months ago
The Remote Enqueue Operation on Networks of Workstations
Abstract. Modern networks of workstations connected by Gigabit networks have the ability to run high-performance computing applications at a reasonable performance, but at a signi ...
Evangelos P. Markatos, Manolis Katevenis, Penny Va...
PLDI
2003
ACM
15 years 2 months ago
Region-based hierarchical operation partitioning for multicluster processors
Clustered architectures are a solution to the bottleneck of centralized register files in superscalar and VLIW processors. The main challenge associated with clustered architectu...
Michael L. Chu, Kevin Fan, Scott A. Mahlke
SPAA
1998
ACM
15 years 1 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