Optimum solution based on constraint problems, Computer Engineering

Optimum solution based on constraint problems:

Whether depending on what solver you are using so there constraints are often expressed as relationships between variables as e.g., x1 + x2 < x3. Moreover,, just to be able to discuss constraints more formally that we use the following notation regularly: 

So here a constraint Cijk  justified that tuples of values variables xi, xj  and xk  all are allowed to take simultaneously. However in plain English there a constraint normally talks regaids things that can't happen so but in our formalism then we are looking at tuples as vi, vj, vk that xi, xj and xk can take simultaneously. Moreover as a simple example, now assume we have a CSP with two variables x and y, and in which x can take values {1,2,3}, when y can take values {2,3}. After then the constraint that x=y would be written like: 

Cxy={(2,2), (3,3)}, 

So there the constraint that x

Cxy = {(1,2),(1,3),(2,3)} 

Conversely a solution to a CSP is an assignment of values that one to each variable in such a way that no constraint is broken. So here it depends on the problem at hand so the user might want to know that there is a solution such i.e., they will take the first answer given.

However they may utilize all the solutions to the problem and they might want to know that no solution exists. In fact sometimes there the point of the exercise is to find the optimum solution based on some measure of worth. So sometimes, it's possible to do this without enumerating all the solutions thus other times there it will be necessary to find all solutions or then work out which is the optimum. However in the high-IQ problem there a solution is simply a set of lengths, one per square. Mostly the shaded one is the 17th biggest that answers the IQ question.

Posted Date: 1/11/2013 7:33:44 AM | Location : United States







Related Discussions:- Optimum solution based on constraint problems, Assignment Help, Ask Question on Optimum solution based on constraint problems, Get Answer, Expert's Help, Optimum solution based on constraint problems Discussions

Write discussion on Optimum solution based on constraint problems
Your posts are moderated
Related Questions
Downcasting concept is the casting from a general to a more particular type, i.e. casting down the hierarchy in programming

Q. Calculate Register Transfer Time? A clock isn't included explicitly in any statements discussed above. But it is presumed that all transfers take place during clock edge tra

Super scalar architecture Pentium microprocessor is organized with three execution units. One executes floating-point instructions and other two (U-pipe and V-pipe) execute in

Conversion of Decimal Number to Binary Number: For converting a decimal number to binary integer part and fractional part are handled separately. Let's describe it with help of

Busy hour traffic is the (A)  maximum average simultaneous traffic. (B)  traffic during peak hour. (C)  traffic when all subscribers are engaged. (D)  the durat

In what way is stored program control superior to hard wired control? The SPC gains superiority over hard wired because of following points: SP C Ha

Write a procedure which divides a 32-bit number by a 16-bit number. The procedure must be general which is it's defined in one module and can be called from another assembly module

Efficiency of Vector Processing over Scalar Processing As we know a serial computer processes single scalar operands at a time. So if we have to process a vector of length 'n'

Using               ARQ, a sending modem must wait for a return ACK for each sent block before sending the next block. (A)  discrete                                      (B)

Proving ( or disproving) mathematical theorems are an intensive intellectual task. This is because it requires deductions from hypotheses and also involves judgment. This judgm