Variable ordering - forward checking, Computer Engineering

Variable ordering - Forward checking:

Hence this is different from variable ordering in two important ways as: 

  • Whether this is a dead end when we will end up visiting all the values for this variable anyway then fail-first does not make sense for values. In fact we try and keep our options open as much more as possible but this will help whether there is a solution ahead of us. 
  • Thus unlike the variable ordering heuristics there this heuristic carries an extra cost on top of forward checking this means the reduction in domain sizes of future variables for every assignment of the current variable utilizes to be checked. Therefore it is possible that this kind of value ordering will slow things down. In such a scenario this is what happens for randomly constructed binary CSPs. In fact on occasions however there it can sometimes be a very good idea to employ dynamic value ordering also.
Posted Date: 1/12/2013 6:03:16 AM | Location : United States







Related Discussions:- Variable ordering - forward checking, Assignment Help, Ask Question on Variable ordering - forward checking, Get Answer, Expert's Help, Variable ordering - forward checking Discussions

Write discussion on Variable ordering - forward checking
Your posts are moderated
Related Questions
You have been asked to become the consulting technician for MobTex, a local auto servicing centre. The general manager (Jo) realises that the IT system has evolved over time with l

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b

Fitness function - canonical genetic algorithm: Conversely the fitness function will use an evaluation function to calculate a value of worth for the individual accordingly th

how many pins does a floppy drive connector have

i read in b.tech 3year.i can go to hadrabad becouse read of branch parer.why the best instituies in hadrabad in purpus gate and branch paper

explain different types of parallel processing mechanism

Q. Explain about Barrier? Barrier: No actual transfer of data takes place in this mode unless all the processors involved in the communication execute a particular block, calle

What is use case and use case diagram? A use case is a coherent piece of functionality that a system can give by interacting with actors. Use case includes one or more actors a

MinMax Search Parents frequently get two children to share a cake by asking one to cut the cake and the other to select which half they want to eat. In this two player cake-sco

Q. What do you mean by Lock Synchronization? Lock Synchronization: In this method contents of an atom are updated by requester process and sole access is granted before atomic