"Candidate Solutions" Please respond to the following:

Computer Science
Tutor: None Selected Time limit: 1 Day

Identify and explain the different techniques for identifying candidate solutions.

Nov 4th, 2014

In optimization (a branch of mathematics) and search algorithms (a topic in computer science), a candidate solution is a member of a set of possible solutions to a given problem. A candidate solution does not have to be a likely or reasonable solution to the problem—it is simply in the set that satisfies all constraints; that is, it is in the set of feasible solutions. Algorithms for solving various types of optimization problems often narrow the set of candidate solutions down to a subset of the feasible solutions, whose points remain as candidate solutions while the other feasible solutions are henceforth excluded as candidates.

Different Techniques:

Genetic Algorithms

Calculus

Linear Programming

Reference:

http://en.wikipedia.org/wiki/Candidate_solution


Nov 4th, 2014

Did you know? You can earn $20 for every friend you invite to Studypool!
Click here to
Refer a Friend
...
Nov 4th, 2014
...
Nov 4th, 2014
Dec 6th, 2016
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer