Variable ordering
Yüklə
0,71 Mb.
tarix
28.06.2018
ölçüsü
0,71 Mb.
#52236
Bu səhifədəki naviqasiya:
Domain dependent heuristics
Assign a heuristic value to a variable that estimates how difficult/easy it is to find a satisfying value for that variable
All solutions All solutions
Goal: minimize size of search space explored
Variable
ordering
Variable ordering
what variable to branch on next
Value ordering
given
a choice of variable
, what order to try values
Constraint ordering
what order to propagate constraints
most likely to fail
or cheapest propagated first
Domain dependent heuristics
Domain dependent heuristics
Domain independent heuristics
Static
variable ordering
fixed before search starts
Dynamic variable ordering
chosen during search
Assign a heuristic value to a variable that estimates how difficult/easy it is to find a satisfying
value for that variable
Assign a heuristic value to a variable that estimates how difficult/easy it is to find a satisfying value for that variable
All solutions
All solutions
value
ordering not important
why?
One solution
if a solution exists, there exists a
perfect
value ordering
Insoluble instance
like all solutions
why?
Goal: minimize
size of search space explored
Goal: minimize size of search space explored
Principle:
given that we have already chosen the next variable to instantiate, choose first the values that are most likely to succeed
The most
promising
value
Yüklə
0,71 Mb.
Dostları ilə paylaş:
Verilənlər bazası müəlliflik hüququ ilə müdafiə olunur ©genderi.org 2024
rəhbərliyinə müraciət
Ana səhifə
Psixologiya