2354 search results - page 55 / 471 » Randomness, Stochasticity and Approximations |
149
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
113
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
136
Voted
AAIM
2008
Springer
15 years 6 months ago
2008
Springer
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.
137
click to vote
AAIM
2008
Springer
15 years 10 months ago
2008
Springer
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...
152
click to vote
CCE
2010
15 years 1 months ago
2010
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...