556 search results - page 12 / 112 » Pair Programming: Not for Everyone |
SIGCSE
2010
ACM
13 years 8 months ago
2010
ACM
An analysis of data from 259 CS1 students is performed to compare the performance of students who were paired by demonstrated ability to that of students who were paired randomly ...
AGILEDC
2006
IEEE
14 years 1 months ago
2006
IEEE
We have an Extreme Programming team at a small company dedicated to the Agile approach. Our team of 7 developers decided to use the pairing session as the fundamental unit of work...
FLOPS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...
DISOPT
2007
13 years 7 months ago
2007
We present a scheme for generating new valid inequalities for mixed integer programs by taking pairwise combinations of existing valid inequalities. Our scheme is related to mixed...
FLOPS
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a backward sharing analysis for logic programs. The analysis computes pre-conditions for a query that guarantee a given post-condition is satisfied after the q...