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.
2014
2014
During decoding, the Statistical Machine Translation (SMT) decoder travels over all complete paths on the Search Graph (SG… 
2013
2013
Checking the language inclusion between two models is a fundamental problem arising in application areas such as formal… 
2010
2010
Given the existence of large fingerprint databases, including distributed systems, the development of algorithms for performing… 
2010
2010
This paper analyzes the knowledge sharing process that characterizes Product Service Systems (PSS) design, drawing on data from… 
Review
2009
Review
2009
Harding, Christopher, Baker, Estella, (2009) 'From past imperfect to future perfect? A longitudinal study of the Third Pillar… 
2002
2002
Department of Computer Science, Cornell UniversityIthaca, NY 14853, USAfbhaskar,gomesg@cs.cornell.eduAbstract. We introduce… 
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… 
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…