Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Backtracking

Known as: Backtracking search, Backtracking algorithm, Backtrack 
Backtracking is a general algorithm for finding all (or some) solutions to some computational problems, notably constraint satisfaction problems… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
This paper introduces the Backtracking Search Optimization Algorithm (BSA), a new evolutionary algorithm (EA) for solving real… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Analyzing intrusions today is an arduous, largely manual task because system administrators lack the information and tools needed… Expand
  • figure 1
  • figure 3
  • figure 4
  • table I
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Analyzing intrusions today is an arduous, largely manual task because system administrators lack the information and tools needed… Expand
  • figure 1
  • figure 3
  • figure 4
  • table I
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Clustering is traditionally viewed as an unsupervised method for data analysis. However, in some cases information about the… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 2
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Abstract This paper describes an implementation of the Lin–Kernighan heuristic, one of the most successful methods for generating… Expand
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
  • M. Ginsberg
  • J. Artif. Intell. Res.
  • 1993
  • Corpus ID: 10355585
Because of their occasional need to return to shallow points in a search tree, existing backtracking methods can sometimes erase… Expand
  • figure 2.3
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Backtrack search is often used to solve constraint satisfaction problems. A relationship involving the structure of the… Expand
  • figure 1
Is this relevant?
Highly Cited
1982
Highly Cited
1982
A constraint satisfaction problem revolves finding values for a set of variables subject to a set of constraints (relations) on… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1982
Highly Cited
1982
SUMMARY Backtrack algorithms are applicable to a wide variety of problems. An efficient but readable version of such an algorithm… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1977
Highly Cited
1977
Abstract We present a rule-based system for computer-aided circuit analysis. The set of rules, called EL, is written in a rule… Expand
  • figure I
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Is this relevant?