Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,322 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Algorithm
Backtracking
Branch (computer science)
Constraint learning
Expand
Broader (1)
Constraint programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Algebraic Structures for Bipolar Constraint-Based Reasoning
H. Fargier
,
Nic Wilson
European Conference on Symbolic and Quantitative…
2007
Corpus ID: 1660346
The representation of both scales of cost and scales of benefit is very natural in a decision-making problem: scales of…
Expand
2001
2001
Distributed Forward Checking with Dynamic Ordering
A. Meisels
,
Igor Razgon
2001
Corpus ID: 15716214
2001
2001
Interactive Modeling for Batch Simulation of Engineering Systems: A Constraint Satisfaction Problem
D. Mitra
International Conference on Industrial…
2001
Corpus ID: 41330054
We have presented here an algorithm CPRAO for doing constraint processing using relational algebraic operators. Van Beek and…
Expand
1999
1999
Using an Incomplete Version of Dynamic Backtracking for Graph Colouring
S. Prestwich
Electron. Notes Discret. Math.
1999
Corpus ID: 18529682
1999
1999
Extending CLP(FD) with Interactive Data Acquisition for 3D Visual Object Recognition
M.Gavanelli
,
E. Lamma
1999
Corpus ID: 12331375
This paper addresses the 3D object recognition problem modelled as a Constraint Satisfaction Problem. In this setting, each…
Expand
1997
1997
Local Consistency for Ternary Numeric Constraints
B. Faltings
,
E. Gelle
International Joint Conference on Artificial…
1997
Corpus ID: 7657014
Reference LIA-CONF-1997-007View record in Web of Science Record created on 2006-12-13, modified on 2016-08-08
1996
1996
Nogood Learning for Constraint Satisfaction
E. T. Richards
,
B. Richards
1996
Corpus ID: 16947474
The basic algorithm is derived from the weak-commitment algorithm (WC) of Yokoo [17], which has been shown to outperform breakout…
Expand
1994
1994
Maximal Sets of Solutions for Constraint Satisfaction Problems
D. Lesaint
European Conference on Artificial Intelligence
1994
Corpus ID: 16823166
Real constrained problems often demand specific answers to meet requirements like bounded computation time, user preferences or…
Expand
1992
1992
Recognition of 3-D objects by forward checking constrained search
Chang J. Cho
,
J. H. Kim
Robotics Auton. Syst.
1992
Corpus ID: 5224831
1982
1982
Consistent-Labeling Problems and Their Algorithms
Bernard Nudel
AAAI Conference on Artificial Intelligence
1982
Corpus ID: 15916615
Two new classes of theories have been developed giving the expected complexities of three Consistent-Labeling Problem (CLP), or…
Expand
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)
ACCEPT & CONTINUE