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.
2009
2009
We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed… 
Review
2009
Review
2009
Harding, Christopher, Baker, Estella, (2009) 'From past imperfect to future perfect? A longitudinal study of the Third Pillar… 
2004
2004
Quality management is becoming a more and more important part of the software development process. As software testing is… 
2004
2004
∗ A. Helmy was supported by NSF CAREER Award 0134650. Abstract Traditional protocols for routing in ad hoc networks attempt to… 
2003
2003
Neoliberal economic reforms in post-socialist Tanzania heightened racial as well as anti-foreign hostilities, while liberal… 
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… 
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… 
Review
1982
Review
1982
This paper discusses path delay analysis programs as an alternative to detailed logic simulation for finding timing problems in…