Finding best Solution in Computer Science
There are methods to find solutions that is not necessarily best solution, but can find a best possible solution in a Serach Space (i.e. the space of all feasible solutions).
There are problems that can not be solved by traditional way and such problems are called NP-problems.
Problems that can not be solved in polnomyal time is such problems that need another way to solve problems. NP stands for Non-determinsitic polynomial and we can only "guess" a solution and then check the solution.Nobody today knows if there is fast exact algorithm. Proving or disproving this is a task for future reseracher. To find such algorithm today they use the following methods and Genetic Algorothm is one of them.
Hill climbing
Tabu search
Simulated annealing
Genetic algorithm
Look at Wikipedia to find out more about the finding solutions.
No comments:
Post a Comment