Computer Science – Artificial Intelligence
Scientific paper
2007-10-18
J. Stat. Mech. (2008) P01013
Computer Science
Artificial Intelligence
Scientific paper
10.1088/1742-5468/2008/01/P01013
A method for the construction of approximate analytical expressions for the stationary marginal densities of general stochastic search processes is proposed. By the marginal densities, regions of the search space that with high probability contain the global optima can be readily defined. The density estimation procedure involves a controlled number of linear operations, with a computational cost per iteration that grows linearly with problem size.
No associations
LandOfFree
Stationary probability density of stochastic search processes in global optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Stationary probability density of stochastic search processes in global optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stationary probability density of stochastic search processes in global optimization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-461582