In backtracking algorithms, look ahead is the generic term for a subprocedure that attempts to foresee the effects of choosing a branching variableâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2004

2004

Component allocation with multiple resource constraints for large embedded real-time software design

- Shige Wang, Jeffrey R. Merrick, Kang G. Shin
- Proceedings. RTAS 2004. 10th IEEE Real-Time andâ€¦
- 2004

Allocating software components while meeting multiple platform resource constraints is crucial for model-based design of largeâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Toby Walsh
- ECAI
- 2002

To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programmingâ€¦Â (More)

Is this relevant?

1999

1999

- Romuald Debruyne
- ICTAI
- 1999

Filtering techniques are essential to efficiently look for a solution in a constraint network (CN). However, for a long time itâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Kostas Stergiou, Manolis Koubarakis
- AAAI/IAAI
- 1998

We extend the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints of theâ€¦Â (More)

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

- GÃ©rard Verfaillie, Michel LemaÃ®tre, Thomas Schiex
- AAAI/IAAI, Vol. 1
- 1996

If the Constraint Satisfaction framework has been extended to deal with Constraint Optimization problems, it appears thatâ€¦Â (More)

Is this relevant?

1996

1996

- Daniel Frost, Rina Dechter
- CP
- 1996

Haralick and Elliott's full looking ahead algorithm [4] was presented in the same article as forward checking, but is not asâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Fahiem Bacchus, Paul van Run
- CP
- 1995

We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solvingâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Barbara M. Smith, Stuart A. Grant
- IJCAI
- 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

Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory-Based Heuristics

- Bernard Nudel
- Artif. Intell.
- 1983

ABSTRACI" A new parameter is introduced to characterize a type of search problem of broad relevance in artificial intelligenceâ€¦Â (More)

Is this relevant?