2354 search results - page 149 / 471 » Randomness, Stochasticity and Approximations |
158
click to vote
CONCUR
1999
Springer
15 years 8 months ago
1999
Springer
d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...
160
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
157
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
135
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract--Recently, it has been shown that a quantize-mapand-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitr...
143
click to vote
CORR
2012
Springer
14 years 1 days ago
2012
Springer
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...