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)

Related topics

Related topics

50 relations
Alma-0BackmarkingBeam stack searchBottom-up parsing

Broader (1)

Operations research

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Dynamic selection of enumeration strategies for solving constraint satisfaction problems
The main goal concerning Constraint Satisfaction Problems is to determine a value assignment for variables satisfying a set of… 
2009
2009
Execution Strategies for PTIDES, a Programming Model for Distributed Embedded Systems
We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed… 
2006
2006
Model Checking of Software Components: Combining Java PathFinder and Behavior Protocol Model Checker
Although there exist several software model checkers that check the code against properties specified e.g. via a temporal logic… 
2003
2003
From race to citizenship: The indigenization debate in post-socialist Tanzania
Neoliberal economic reforms in post-socialist Tanzania heightened racial as well as anti-foreign hostilities, while liberal… 
2003
2003
On the Complexity of Distributed Self-Configuration in Wireless Networks
We consider three distributed configuration tasks that arise in the setup and operation of multi-hop wireless networks: partition… 
Highly Cited
2002
Highly Cited
2002
Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems
In this paper, we study the capacitated Euclidean andlpdistance location-allocation problems. There exists no global optimization… 
2001
2001
Model based testing in evolutionary software development
The spiraling nature of evolutionary software development processes produces executable parts of the system at the end of each… 
1997
1997
On the Correctness of Inside-Out Routing Algorithm
Recently, a new routing algorithm called inside-out routing algorithm was proposed for routing an arbitrary permutation in the… 
1996
1996
A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations
We discuss issues relevant to the practical use of a previously proposed notation for lambda terms in contexts where the… 
Highly Cited
1988
Highly Cited
1988
SPLIT circuit model for test generation
  • W.-T. Cheng
  • 25th ACM/IEEE, Design Automation Conference…
  • 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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)