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… 
2006
2006
Although there exist several software model checkers that check the code against properties specified e.g. via a temporal logic… 
2004
2004
Quality management is becoming a more and more important part of the software development process. As software testing is… 
2003
2003
Neoliberal economic reforms in post-socialist Tanzania heightened racial as well as anti-foreign hostilities, while liberal… 
Highly Cited
2002
Highly Cited
2002
In this paper, we study the capacitated Euclidean andlpdistance location-allocation problems. There exists no global optimization… 
2001
2001
The spiraling nature of evolutionary software development processes produces executable parts of the system at the end of each… 
1996
1996
We discuss issues relevant to the practical use of a previously proposed notation for lambda terms in contexts where the… 
1990
1990
In order to specify the relationship between pictures and their meaning, a class of declarative, constraint-based picture… 
Highly Cited
1988
Highly Cited
1988
  • W.-T. Cheng
  • 1988
  • Corpus ID: 17781797
A novel circuit model, SPLIT, is presented which is a modified 9-valued circuit model. SPLIT has the precision of the 9-valued…