Sciweavers

884 search results - page 41 / 177
» Control structures in programs and computational complexity
Sort
View
POPL
2003
ACM
14 years 8 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
ICC
2009
IEEE
190views Communications» more  ICC 2009»
14 years 2 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
FECS
2006
113views Education» more  FECS 2006»
13 years 9 months ago
A Lightweight Program Similarity Detection Model using XML and Levenshtein Distance
Program plagiarism is one of the most significant problems in Computer Science education. Most common plagiarism includes modifying comments, reordering statements, and changing v...
Seo-Young Noh, Sangwoo Kim, Cheonyoung Jung
DAC
1999
ACM
13 years 12 months ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik
SIGCSE
1998
ACM
97views Education» more  SIGCSE 1998»
13 years 12 months ago
Towards a hierarchical design and integration of programming projects
,’ Theideaof ahierarchicaldesignandintegrationof programming projectsin the computerscienceundergraduatecurriculum is proposedanddiscussed.Researchresultsin softwarereuseandobje...
Wing Ning Li