Skip to search formSkip to main contentSkip to account menu

Cross-entropy method

Known as: Cross entropy method 
The cross-entropy (CE) method attributed to Reuven Rubinstein is a general Monte Carlo approach tocombinatorial and continuous multi-extremal… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The Expectation-Maximization (EM) algorithm for mixture models often results in slow or invalid convergence. The popular… 
2011
2011
The genomes of complex organisms, including the human genome, are known to vary in GC content along their length. That is, they… 
2011
2011
In this paper vehicle routing problem with stochastic demands and simultaneous delivery and pickup is developed and analyzed… 
2010
2010
The response time variability problem (RTVP) is an NP-hard combinatorial scheduling problem that has recently appeared in the… 
2009
2009
The Generation Expansion Planning (GEP) problem is a highly constrained, large-scale, mixed integer nonlinear programming problem… 
2008
2008
Traditional Moonier Carlo method usually takes a long time to simulate rare event, while importance sampling techniques can… 
2008
2008
This paper describes the synthesis of linear antenna arrays using the cross entropy (CE) method to produce array responses with… 
Review
2006
Review
2006
The EM algorithm is a very powerful optimization method and has reached popularity in many fields. Unfortunately, EM is only a… 
2004
2004
  • W. Sandmann
  • 2004
  • Corpus ID: 16656345
We consider the probability that the population in a two node tandem Jackson network reaches some high level during a busy period…