556 search results - page 101 / 112 » Pair Programming: Not for Everyone |
122
click to vote
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
226
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
136
click to vote
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
We address the problem of balancing the traffic load in multi-hop wireless networks. We consider a point-to-point communicating network with a uniform distribution of source-sink ...
160
click to vote
ISBRA
2009
Springer
15 years 10 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
125
Voted
IFIP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...