Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Data mining is used to find the hidden information pattern and relationship between the large data set which is very useful in… 
2010
2010
Given the existence of large fingerprint databases, including distributed systems, the development of algorithms for performing… 
Review
2009
Review
2009
Harding, Christopher, Baker, Estella, (2009) 'From past imperfect to future perfect? A longitudinal study of the Third Pillar… 
2004
2004
∗ A. Helmy was supported by NSF CAREER Award 0134650. Abstract Traditional protocols for routing in ad hoc networks attempt to… 
1999
1999
Abstract. When archives of paper documents are to be accessed via the Internet, the implicit hypertext structure of the original… 
1999
1999
Several content-based queries in spatial databases and geographic infonnation systems (GISs) can be modelled and processed as… 
1998
1998
: This paper presents a progress report on the implementation of an ALCRP ( D ) ABox reasoner and a knowledge representation… 
1997
1997
A correspondence between two-dimensional Golomb rectangles and one-dimensional Golomb rulers is given. Results are translated… 
1995
1995
In this paper we present a constraint logic programming scheme for reactive systems. A formal framework is developed to deene the… 
1993
1993
  • Michael Fisher
  • 1993
  • Corpus ID: 1751555
Concurrent MetateM is a programming language based on the notion of concurrent, communicating objects, where each object directly…