Skip to search formSkip to main contentSkip to account menu

Local search (optimization)

Known as: Local search algorithm, K-opt, K-Opt method 
In computer science, local search is a heuristic method for solving computationally hard optimization problems. Local search can be used on problems… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Spatial modulation (SM) is attractive for multi-antenna wireless communications. SM uses multiple transmit antenna elements but… 
Highly Cited
2011
Highly Cited
2011
In this paper, we present a new hardware-oriented, modified diamond search (HMDS) algorithm, for fast integer pel, motion… 
2011
2011
Based on our recent study on probability distributions for evolution in extremal optimization (EO), we propose a modified… 
Highly Cited
2007
Highly Cited
2007
The course timetabling problem deals with the assignment of a set of courses to specific timeslots and rooms within a working… 
Highly Cited
2003
Highly Cited
2003
The prediction of a protein's structure from its amino-acid sequence is one of the most important problems in computational… 
Highly Cited
2000
Highly Cited
2000
Proposes a divided-range multi-objective genetic algorithm (DRMOGA), which is a model for the parallel processing of genetic… 
Highly Cited
1997
Highly Cited
1997
  • Stan Birchfield
  • 1997
  • Corpus ID: 5548179
A simple algorithm for tracking a person's head is presented. A two-dimensional model, namely an ellipse, is used to approximate… 
Highly Cited
1997
Highly Cited
1997
In the literature (see, e.g. Bertsimas and Tsitsiklis [1994], Chvatal [1983] and Garfinkel and Nemhauser [1972]), a number of… 
Highly Cited
1987