Sciweavers

556 search results - page 67 / 112
» Pair Programming: Not for Everyone
Sort
View
ENTCS
2008
97views more  ENTCS 2008»
13 years 9 months ago
Global State Considered Helpful
Reynolds' view of a storage cell as an expression-acceptor pair has been widely used by researchers. We present a different way of organizing semantics of state, and in parti...
Paul Blain Levy
IANDC
2008
95views more  IANDC 2008»
13 years 9 months ago
Comparing communication primitives via their relative expressive power
In this paper, we study sixteen communication primitives, arising from the combination of four useful programming features: synchronism (synchronous vs asynchronous primitives), a...
Daniele Gorla
JMLR
2006
89views more  JMLR 2006»
13 years 9 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
ORL
2008
77views more  ORL 2008»
13 years 9 months ago
A short proof of the VPN Tree Routing Conjecture on ring networks
The VPN Tree Routing Conjecture states that there always exists an optimal solution to the symmetric Virtual Private Network Design (sVPND) problem where the paths between all ter...
Fabrizio Grandoni, Volker Kaibel, Gianpaolo Oriolo...
COCOON
2010
Springer
13 years 7 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen