Sciweavers

1450 search results - page 112 / 290
» On the Complexity of Hardness Amplification
Sort
View
LCTRTS
1999
Springer
14 years 1 months ago
Live Memory Analysis for Garbage Collection in Embedded Systems
Real-time garbage collection is essential if object-oriented languages (in particular, Java) are to become predictable enough for real-time embedded systems. Although techniques f...
Patrik Persson
VLDB
1999
ACM
112views Database» more  VLDB 1999»
14 years 1 months ago
Context-Based Prefetch for Implementing Objects on Relations
When implementing persistent objects on a relational database, a major performance issue is prefetching data to minimize the number of roundtrips to the database. This is especial...
Philip A. Bernstein, Shankar Pal, David Shutt
FCCM
1997
IEEE
118views VLSI» more  FCCM 1997»
14 years 1 months ago
Implementation of single precision floating point square root on FPGAs
Square root operation is hard to implement on FPGAs because of the complexity of the algorithms. In this paper, we present a non-restoring square root algorithm and two very simpl...
Yamin Li, Wanming Chu
EKAW
1994
Springer
14 years 1 months ago
Evaluating a Formal Modelling Language
Formal knowledge modelling languages have a number of advantages over informal languages, such as their precise meaning and the possibility to derive propertiesthrough formal proof...
Fidel Ruiz, Frank van Harmelen, Manfred Aben, Joke...
SC
1993
ACM
14 years 1 months ago
Volume rendering of 3D scalar and vector fields at LLNL
Simulation of complex 3-dimensional phenomena generate data sets which are hard to comprehend using conventional 2-dimensionally oriented visualization tools. One way to overcome ...
Roger Crawfis, Nelson L. Max, Barry G. Becker, Bri...