556 search results - page 111 / 112 » Pair Programming: Not for Everyone |
110
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
154
Voted
CP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
141
Voted
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
117
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
We examine the problem of minimizing feedbacks in reliable wireless broadcasting, by pairing rateless coding with extreme value theory. Our key observation is that, in a broadcast ...
182
Voted
BMCBI
2011
14 years 10 months ago
2011
Background: The combination of genotypic and genome-wide expression data arising from segregating populations offers an unprecedented opportunity to model and dissect complex phen...