118 search results - page 9 / 24 » Greedy algorithms for on-line set-covering and related probl... |
195
click to vote
TNN
2008
15 years 6 months ago
2008
Hard-margin support vector machines (HM-SVMs) suffer from getting overfitting in the presence of noise. Soft-margin SVMs deal with this problem by introducing a regularization term...
180
click to vote
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
: This paper presents a demand-based engineering method for designing radio networks of cellularmobile communicationsystems. The proposed procedure is based on a forward-engineerin...
171
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
190
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
206
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...