Sciweavers

644 search results - page 53 / 129
» Graph structured program evolution
Sort
View
CORR
2006
Springer
100views Education» more  CORR 2006»
14 years 12 months ago
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
This paper describes an efficient implementation of binning for decode-and-forward (DF) in relay channels using lowdensity parity-check (LDPC) codes. Bilayer LDPC codes are devised...
Peyman Razaghi, Wei Yu
ICFP
2010
ACM
15 years 28 days ago
Bidirectionalizing graph transformations
Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results o...
Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hir...
KBSE
2007
IEEE
15 years 6 months ago
Exploring the neighborhood with dora to expedite software maintenance
Completing software maintenance and evolution tasks for today’s large, complex software systems can be difficult, often requiring considerable time to understand the system well...
Emily Hill, Lori L. Pollock, K. Vijay-Shanker
GG
2008
Springer
15 years 28 days ago
Workshop on Graph Computation Models
A variety of computation models have been developed using graphs and graph transformations. These include models for sequential, distributed, parallel or mobile computation. A grap...
Mohamed Mosbah, Annegret Habel
CASCON
1993
117views Education» more  CASCON 1993»
15 years 1 months ago
Documenting-in-the-large vs. documenting-in-the-small
There is a signi cant di erence between documentinglarge programs and documenting small ones. By large programs we mean on the order of 1,000,000 lines, usually written by many di...
Scott R. Tilley