Add to ORKGABSTRACT: Introduction to branching processes and sequential decoding -- Sequential decoding in a varying channel -- Theoretical results -- Simulation results -- Side-information of the channel state -- Transfer between states -- Influence of the supercritical blocks -- Influence of the stack size on experimental results
The focus of this work lies on implementational improvements and, in particular, node-level performa...
AbstractThis paper describes a memory management discipline for programs that perform dynamic memory...
A model of a message-passing network is used to analyze the behavior of three implementations of the...
ABSTRACT: Sequential decoding of punctured convolutional codes by the fano and stack algorithms : ex...
ABSTRACT: Description of the proposed algorithm -- Elements of error performance analysis -- Computa...
Les modèles génétiques de réservoirs sont construits par la simulation des principaux processus de s...
This version of research report 9400 is only a draft of a paper currently being submitted for public...
Les modèles computationnels de la lecture adoptent pour la plupart une architecture double-voie qui ...
A modified version of the stack algorithm of sequential decoding is presented for the decoding of hi...
Techniques to evaluate a program’s cache performance fall into two camps: 1. Traditional trace-base...
The constant evolution of processors architectures, with superscalar, instruction-level parallelism,...
Nous nous focalisons sur l'échantillonnage comme une technique de simulation pour réduire le temps d...
This paper reports on the performance of five parallel algorithms for simulating a fully associative...
No abstract available.The original print copy of this thesis may be available here: http://wizard.un...
La Computation Approximée est basée dans l'idée que des améliorations significatives de l'utilisatio...
The focus of this work lies on implementational improvements and, in particular, node-level performa...
AbstractThis paper describes a memory management discipline for programs that perform dynamic memory...
A model of a message-passing network is used to analyze the behavior of three implementations of the...
ABSTRACT: Sequential decoding of punctured convolutional codes by the fano and stack algorithms : ex...
ABSTRACT: Description of the proposed algorithm -- Elements of error performance analysis -- Computa...
Les modèles génétiques de réservoirs sont construits par la simulation des principaux processus de s...
This version of research report 9400 is only a draft of a paper currently being submitted for public...
Les modèles computationnels de la lecture adoptent pour la plupart une architecture double-voie qui ...
A modified version of the stack algorithm of sequential decoding is presented for the decoding of hi...
Techniques to evaluate a program’s cache performance fall into two camps: 1. Traditional trace-base...
The constant evolution of processors architectures, with superscalar, instruction-level parallelism,...
Nous nous focalisons sur l'échantillonnage comme une technique de simulation pour réduire le temps d...
This paper reports on the performance of five parallel algorithms for simulating a fully associative...
No abstract available.The original print copy of this thesis may be available here: http://wizard.un...
La Computation Approximée est basée dans l'idée que des améliorations significatives de l'utilisatio...
The focus of this work lies on implementational improvements and, in particular, node-level performa...
AbstractThis paper describes a memory management discipline for programs that perform dynamic memory...
A model of a message-passing network is used to analyze the behavior of three implementations of the...