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.
2013
2013
Simple Temporal Networks with Uncertainty (STNUs) allow the representation of temporal problems where some durations are… 
2010
2010
Given the existence of large fingerprint databases, including distributed systems, the development of algorithms for performing… 
2009
2009
We define a family of execution policies for a programming model called PTIDES (Programming Temporally Integrated Distributed… 
2004
2004
Quality management is becoming a more and more important part of the software development process. As software testing is… 
2004
2004
PRODEP III - Medida 5 - Accao 5.3 - Eixo 3 - Formacao Avancada de Docentes do Ensino Superior; PPC-VM - POSI/CHS/47158/2002. 
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… 
1995
1995
In this paper we present a constraint logic programming scheme for reactive systems. A formal framework is developed to deene the… 
1986
1986
Tour d'horizon des tentatives des psychologues dans le domaine de la reduction du risque de guerre nucleaire. Efforts tendus vers…