Sciweavers

849 search results - page 133 / 170
» Completely Non-malleable Schemes
Sort
View
DSN
2000
IEEE
14 years 1 months ago
Exploiting Non-Determinism for Reliability of Mobile Agent Systems
An important technical hurdle blocking the adoption of mobile agent technology is the lack of reliability. Designing a reliable mobile agent system is especially challenging since...
Ajay Mohindra, Apratim Purakayastha, Prasannaa Tha...
SC
2000
ACM
14 years 1 months ago
Landing CG on EARTH: A Case Study of Fine-Grained Multithreading on an Evolutionary Path
We report on our work in developing a fine-grained multithreaded solution for the communicationintensive Conjugate Gradient (CG) problem. In our recent work, we developed a simpl...
Kevin B. Theobald, Gagan Agrawal, Rishi Kumar, Ger...
CP
2000
Springer
14 years 1 months ago
Maintaining Arc-Consistency within Dynamic Backtracking
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
Narendra Jussien, Romuald Debruyne, Patrice Boizum...
ARITH
1999
IEEE
14 years 1 months ago
Low-Power Division: Comparison among Implementations of Radix 4, 8 and 16
Although division is less frequent than addition and multiplication, because of its longer latency it dissipates a substantial part of the energy in floating-point units. In this ...
Alberto Nannarelli, Tomás Lang
ECOOP
1998
Springer
14 years 1 months ago
Cyclic Distributed Garbage Collection with Group Merger
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference list...
Helena Rodrigues, Richard E. Jones