4940 search results - page 232 / 988 » On the Complexity of Universal Programs |
157
click to vote
SIGCSE
2010
ACM
16 years 1 months ago
2010
ACM
This paper details the results of an investigation into the compatibility of partnered computer science students. The study involved approximately 290 students at the University o...
157
click to vote
AGILEDC
2006
IEEE
16 years 18 days ago
2006
IEEE
Pair programming has been shown to be beneficial for both students and teaching staff in university courses. A two-phased study of 1350 students was conducted at North Carolina St...
148
click to vote
TYPES
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we use the Epigram language to define the universe of regular tree types—closed under empty, unit, sum, product and least fixpoint. We then present a generic deci...
158
click to vote
SIGUCCS
2003
ACM
15 years 11 months ago
2003
ACM
St. Edward’s University has developed a web-based Computer Competency Program ensuring one standard of competency for a diverse student population. Over the past decade faculty ...
167
click to vote
IFIP
2001
Springer
15 years 11 months ago
2001
Springer
: High defect coverage requires good coverage of different fault types. In this paper, we present a comprehensive test vector generation technique for BIST, called Random Single In...