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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1979-2017
05101519792017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
Allocating software components while meeting multiple platform resource constraints is crucial for model-based design of large… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming… (More)
  • figure 1
Is this relevant?
1999
1999
Filtering techniques are essential to efficiently look for a solution in a constraint network (CN). However, for a long time it… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 6
  • figure 7
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The constraint satisfaction community has developed a number of heuristics for variable ordering during backtracking search. For… (More)
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… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
Haralick and Elliott's full looking ahead algorithm [4] was presented in the same article as forward checking, but is not as… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Many types of problem exhibit a phase transition as a problem parameter is varied, from a region where most problems are easy and… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
ABSTRACI" A new parameter is introduced to characterize a type of search problem of broad relevance in artificial intelligence… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?