Hill climbing

Known as: Hill-climbing algorithm, Random hill climbing, Random-restart hill climbing 
In computer science, hill climbing is a mathematical optimization technique which belongs to the family of local search. It is an iterative algorithm… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
In this paper, we use a general hill-climbing attack algorithm based on Bayesian adaption to test the vulnerability of two face… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines… (More)
  • figure 1
  • figure 2
  • figure 1
  • table 1
  • figure 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The key to high performance in Simultaneous Multithreaded (SMT) processors lies in optimizing the distribution of shared… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Maximum power point tracking (MPPT) must usually be integrated with photovoltaic (PV) power systems so that the photovoltaic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper presents a real-coded memetic algorithm that applies a crossover hill-climbing to solutions produced by the genetic… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Automated software module clustering is important for maintenance of legacy systems written in a ‘monolithic format’ with… (More)
  • table 2
  • table 3
  • table 5
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present a new heuristic method to evaluate planning states, which is based on solving a relaxation of the planning problem… (More)
  • figure 1
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Recently several local hill climbing procedures for propositional satis ability have been proposed which are able to solve large… (More)
  • figure 3
  • figure 5
Is this relevant?