556 search results - page 47 / 112 » Pair Programming: Not for Everyone |
IOR
2006
13 years 9 months ago
2006
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
JMLR
2006
13 years 9 months ago
2006
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
WABI
2005
Springer
14 years 2 months ago
2005
Springer
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
VL
2010
IEEE
13 years 7 months ago
2010
IEEE
Many dynamic programming language features, such as implicit declaration, reflection, and code generation, make it difficult to verify the existence of identifiers through standar...
CP
2009
Springer
14 years 9 months ago
2009
Springer
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...