355 search results - page 11 / 71 » A New Approximation Technique for Resource-Allocation Proble... |
108
Voted
ECML
2007
Springer
15 years 6 months ago
2007
Springer
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
122
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
—TD learning and its refinements are powerful tools for approximating the solution to dynamic programming problems. However, the techniques provide the approximate solution only...
APN
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In this work, we address the problem of transient and steadystate analysis of a stochastic Petri net which includes non Markovian distributions with a finite support but ...
WAE
2000
15 years 1 months ago
2000
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...