Skip to search formSkip to main contentSkip to account menu

Stochastic hill climbing

Stochastic hill climbing is a variant of the basic hill climbing method. While basic hill climbing always chooses the steepest uphill move… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Hill climbingStochastic gradient descentStochastic optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Multiobjective Monte Carlo Tree Search for Real-Time Games
Multiobjective optimization has been traditionally a matter of study in domains like engineering or finance, with little impact… 
Highly Cited
2013
Highly Cited
2013
An evolutionary strategy enhanced with a local search technique for the space allocation problem in architecture, Part 1: Methodology
2013
2013
Immunization of complex networks using stochastic hill-climbing algorithm
Recently, there is a growing interest in how to mitigate epidemic spreading through complex networks such as infection… 
Highly Cited
2013
Highly Cited
2013
Smart hill climbing for agile dynamic mapping in many-core systems
Stochastic hill climbing algorithm is adapted to rapidly find the appropriate start node in the application mapping of network… 
Highly Cited
2010
Highly Cited
2010
Classifier evaluation and attribute selection against active adversaries
Many data mining applications, such as spam filtering and intrusion detection, are faced with active adversaries. In all these… 
Highly Cited
2007
Highly Cited
2007
Distributed optimal control of lighting based on stochastic hill climbing method with variable neighborhood
In this research, a smart lighting system based on a new autonomous distributed control method was developed to control lighting… 
2006
2006
Local Search Methods
2003
2003
A Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-Climbing
Parallel algorithms based on stochastic hill-climbing and parallel algorithms based on simple elements of a genetic algorithm for… 
2001
2001
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in… 
Highly Cited
1997
Highly Cited
1997
General floorplanning with L-shaped, T-shaped and soft blocks based on bounded slicing grid structure
A new method of non-slicing floorplanning is proposed, which is based on the new representation for non-slicing floorplans… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)