Wang and Landau algorithm

Known as: Landau (disambiguation) 
The Wang and Landau algorithm, proposed by Fugao Wang and David P. Landau, is a Monte Carlo method designed to calculate the density of states of a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We present preliminary results of the investigation of the properties of the Markov random walk in the energy space generated by… (More)
  • figure 1
Is this relevant?
2016
2016
Knowledge embedding, which projects triples in a given knowledge base to d-dimensional vectors, has attracted considerable… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
We propose a novel tracking algorithm based on the Wang-Landau Monte Carlo (WLMC) sampling method for dealing with abrupt motions… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
This paper presents an H∞ controller design method for networked control systems (NCSs) with bounded packet dropouts. A new model… (More)
  • figure 3
  • figure 2
  • figure 1
Is this relevant?
2009
2009
Performance of Wang-Landau (W-L) algorithm in two continuous spin models is tested by determining the fluctuations in energy… (More)
  • table 1
  • table 2
Is this relevant?
2008
2008
The behavior of a coarse-grained polymer chain in the solution containing two types of interacting species is studied using a… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 6
Is this relevant?
2007
2007
An efficient combination of the Wang-Landau and transition matrix Monte Carlo methods for protein and peptide simulations is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Particle swarm optimization (PSO) as a novel computational intelligence technique, has succeeded in many continuous problems. But… (More)
  • table 1
  • table 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Many vision tasks can be formulated as graph partition problems that minimize energy functions. For such problems, the Gibbs… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Due to many experimental reports of synchronous neural activity in the brain, there is much interest in understanding… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?