Sciweavers

13 search results - page 1 / 3
» Polynomial Time Approximate Sampler for Discretized Dirichle...
Sort
View
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
13 years 9 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
COCOON
2009
Springer
13 years 11 months ago
A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise
We present a polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. The Q-Ising, one of the generalized models of the Ising, arose in the context of Baye...
Masaki Yamamoto, Shuji Kijima, Yasuko Matsui
IPPS
2009
IEEE
13 years 11 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 4 months ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
FOGA
2011
12 years 8 months ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe