traveling salesman problem
a, b, c, d
minimize cost, don't visit same city twice
a, b, c, d = 100 + 230 + 10 = 340
a, d, c, b = 50 + 10 + 230
a, c, b, d
1. generate all permutations of cities
2. add up the cost of traveling on each of the perms
3. find the minimum cost, and print that order of cities
consider for 100 cities
how many diff perms do we have?
comp scientists: work on algorithms
work on new types of hardware
von Neumann arch is basicly a Turing Machine
Quantum Computer
DNA computer
decision tree (part of AI)
expert system
No comments:
Post a Comment