4940 search results - page 123 / 988 » On the Complexity of Universal Programs |
167
click to vote
IFL
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. In this paper we compare three systems for tracing and debugging Haskell programs: Freja, Hat and Hood. We evaluate their usefulness in practice by applying them to a num...
135
Voted
ITICSE
2004
ACM
15 years 10 months ago
2004
ACM
Prior research on pair programming has found that compared to students who work alone, students who pair have shown increased confidence in their work, greater success in CS1, an...
148
click to vote
GPEM
2000
15 years 4 months ago
2000
Genetic programming is an automatic method for creating a computer program or other complex structure to solve a problem. This paper first reviews various instances where genetic p...
127
Voted
SIGCSE
1997
ACM
15 years 8 months ago
1997
ACM
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
157
Voted
ESOP
2008
Springer
15 years 6 months ago
2008
Springer
Abstractions Aziem Chawdhary1 , Byron Cook2 , Sumit Gulwani2 , Mooly Sagiv3 , and Hongseok Yang1 1 Queen Mary, University of London 2 Microsoft Research 3 Tel Aviv University Abstr...