Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Look-ahead (backtracking)

Known as: Backtracking look-ahead, Forward checking 
In backtracking algorithms, look ahead is the generic term for a subprocedure that attempts to foresee the effects of choosing a branching variable… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
Passive testing has proved to be a powerful technique for protocol system fault detection by observing its input/output behaviors… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
We examine the retrieval and mapping tasks of visual analogy as constraint satisfaction problems. We describe a constraint… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2002
2002
There are two well known transformations from non-binary constraints to binary constraints applicable to constraint satisfaction… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
When writing a constraint program, we have to decide what to make the decision variable, and how to represent the constraints on… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
1999
1999
This paper presents a new algorithm for solving frequency assignment problems in cellular mobile systems using constraint… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • table I
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We extend the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints of the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPs. These methods improve… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
If the Constraint Satisfaction framework has been extended to deal with Constraint Optimization problems, it appears that… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We have implemented a comprehensive constraint-based programming language as an extension to COMMON LISP. This constraint package… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Binary constraint sat is fact ion problems involve f ind ing values for variables subject to constraints between pairs of… Expand
  • figure 2
Is this relevant?