Sciweavers

6192 search results - page 307 / 1239
» Structure benefits all
Sort
View
SCCC
2003
IEEE
16 years 4 days ago
Improved Deletions in Dynamic Spatial Approximation Trees
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
Gonzalo Navarro, Nora Reyes
ISORC
2000
IEEE
15 years 11 months ago
Deadline Handling in Real-Time Distributed Objects
: Deadline handling is a fundamental part of real-time computing but has been practiced in ad hoc forms for decades. A general framework for systematic deadline handling in real-ti...
K. H. Kim, Juqiang Liu, Moon-hae Kim
IPPS
1996
IEEE
15 years 11 months ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
ICDCS
1990
IEEE
15 years 11 months ago
Implementing Fault-Tolerant Distributed Applications
This paper develops some control structures suitable for composing fault-tolerant distrib uted applications using atomic actions (atomic transactions) as building blocks, and then...
Santosh K. Shrivastava, Stuart M. Wheater
ICCAD
1995
IEEE
113views Hardware» more  ICCAD 1995»
15 years 10 months ago
Logic decomposition during technology mapping
—A problem in technology mapping is that the quality of the final implementation depends significantly on the initially provided circuit structure. This problem is critical, es...
Eric Lehman, Yosinori Watanabe, Joel Grodstein, He...