Sciweavers

2354 search results - page 222 / 471
» Randomness, Stochasticity and Approximations
Sort
View
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
15 years 11 months ago
Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution
Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...
Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani
DAM
2008
111views more  DAM 2008»
15 years 6 months ago
Sums of squares based approximation algorithms for MAX-SAT
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
Hans van Maaren, Linda van Norden, M. J. H. Heule
132
Voted
JNS
2010
61views more  JNS 2010»
15 years 4 months ago
Validity and Failure of the Boltzmann Approximation of Kinetic Annihilation
This paper introduces a new method to show the validity of a continuum description for the deterministic dynamics of many interacting particles. Here the many particle evolution is...
Karsten Matthies, Florian Theil
CORR
2010
Springer
119views Education» more  CORR 2010»
15 years 6 months ago
Dynamic Policy Programming
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
Mohammad Gheshlaghi Azar, Hilbert J. Kappen
CORR
2011
Springer
168views Education» more  CORR 2011»
15 years 26 days ago
Optimal Column-Based Low-Rank Matrix Reconstruction
We prove that for any real-valued matrix X ∈ Rm×n , and positive integers r k, there is a subset of r columns of X such that projecting X onto their span gives a r+1 r−k+1 -a...
Venkatesan Guruswami, Ali Kemal Sinop