Sciweavers

4722 search results - page 450 / 945
» Representation-independent program analysis
Sort
View
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
15 years 11 months ago
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
ECMDAFA
2006
Springer
107views Hardware» more  ECMDAFA 2006»
15 years 10 months ago
Mutation Analysis Testing for Model Transformations
In MDE, model transformations should be efficiently tested so that it may be used and reused safely. Mutation analysis is an efficient technique to evaluate the quality of test dat...
Jean-Marie Mottu, Benoit Baudry, Yves Le Traon
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
15 years 10 months ago
Memory analysis and significance test for agent behaviours
Many agent problems in a grid world have a restricted sensory information and motor actions. The environmental conditions need dynamic processing of internal memory. In this paper...
DaeEun Kim
WAN
1998
Springer
15 years 10 months ago
Performance Analysis of Wavefront Algorithms on Very-Large Scale Distributed Systems
We present a model for the parallel performance of algorithms that consist of concurrent, two-dimensional wavefronts implemented in a message passing environment. The model combine...
Adolfy Hoisie, Olaf M. Lubeck, Harvey J. Wasserman
AGP
1995
IEEE
15 years 10 months ago
Constraint Systems for Pattern Analysis of Constraint Logic-Based Languages
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...
Roberto Bagnara