12289 search results - page 2136 / 2458 » computing 2006 |
159
click to vote
ANNPR
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
129
Voted
AOSD
2006
ACM
15 years 8 months ago
2006
ACM
The goals of aspect oriented software development (AOSD) and frameworks for configurable protocols (CPs) are similar in many respects. AOSD allows the specification of crosscuttin...
126
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
160
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
158
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...