556 search results - page 13 / 112 » Pair Programming: Not for Everyone |
123
click to vote
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
157
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
123
click to vote
RECOMB
2001
Springer
16 years 4 months ago
2001
Springer
Hidden Markov models (HMMs) have been successfully applied to a variety of problems in molecular biology, ranging from alignment problems to gene nding and annotation. Alignment p...
128
Voted
AGILEDC
2006
IEEE
15 years 10 months 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...
180
click to vote
FROCOS
2011
Springer
14 years 3 months ago
2011
Springer
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...