Sciweavers

436 search results - page 53 / 88
» Recursion and Complexity
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
IPPS
1998
IEEE
14 years 1 months ago
Memory Space Representation for Heterogeneous Network Process Migration
A major difficulty of heterogeneous process migration is how to collect advanced dynamic data-structures, transform them into machine independent form, and restor them appropriate...
Kasidit Chanchio, Xian-He Sun
IPPS
1998
IEEE
14 years 1 months ago
Mechanically Verifying the Correctness of the Fast Fourier Transform in ACL2
In [10], Misra introduced the powerlist data structure, which is well suited to express recursive, data-parallel algorithms. In particular, Misra showed how powerlists could be use...
Ruben Gamboa
AAECC
2006
Springer
122views Algorithms» more  AAECC 2006»
14 years 24 days ago
Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
Shadi Abu-Surra, Gianluigi Liva, William E. Ryan
TAPSOFT
1991
Springer
14 years 16 days ago
Type Inference with Inequalities
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
Michael I. Schwartzbach