2040 search results - page 95 / 408 » Approximate Expectation Maximization |
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
TIT
2010
14 years 6 months ago
2010
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
104
click to vote
SIAMJO
2008
14 years 11 months ago
2008
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
ICANNGA
2007
Springer
15 years 3 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...