As have been shown in the discussions up till now, many system synthesis tasks deal with the problem of finding the best possible solution from a set of solutions which satisfy some design constraints. The problems of system partitioning, scheduling and allocation discussed earlier in this book are good examples of such tasks.
KeywordsSimulated Annealing Solution Space Tabu Search Travel Salesman Problem Travel Salesman Problem
Unable to display preview. Download preview PDF.