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
1. Design a DTD for a new XML application called Library Markup Language (LibML) appropriate to capture the list of your items of collection . Put the DTD into a file named librar

Takes care structural and behavioural aspect of a software system. Contains software usage, functionality, performance, economic, reuse, and technology constraints.

List the allowed register pairs of 8085. B-C register pair D-E register pair H-L register pair

Network throughput It is an indicative measure of the point carrying capacity of a network. It is distinct as the total number of messages the network can transmit per unit tim

What is a deadlock? A deadlock is a situation that can increase when two units, A and B use a shared resource. Assume that unit B cannot complete its task unless unit A complet

Simplify the Boolean expression F = C(B + C)(A + B + C). Ans. Simplification of the given Boolean Expression F = C (B +C) (A+B+C) given as F = C (B+C) (A+B+C) = CB + CC [(A+B+C

System.XML.XLinq.dll has classes to provide functionality to use LINQ with XML.

Question: Read the following case study and answer the questions based on it. The local airline company needs to develop a system for controlling air traffic at the airport

What is overflow, underflow case in single precision(sp)? Underflow-In SP it means that the normalized representation needs an exponent less than -126. Overflow-In SP it mea

Explain the working of Static RAM - Computer Memory? SRAM devices tender extremely fast access times (approximately four times faster than DRAM) but are much more expensive to