Honours Theses Conclusions Exercise

What goes where in a conclusion?

Read the following jumbled conclusion from an Honours thesis in Computer Science and Engineering: the topic is The Steiner Tree Problem.

Can you decide how to rearrange the paragraphs so that they make more sense and follow the logical order of a Conclusion? (Look back at what should be in the conclusion to check the order of information if you need a reminder). When you have decided on the best order, click the 'Check Answers' button to see if your answers match ours.

An advantage of this algorithm is that the computations of the bead’s movement can be done in parallel, provided there is a synchronisation barrier to update their new positions. This can take advantage of some parallel computers, for example mapping each bead to a (virtual) processor.
The Steiner tree has been shown to be an optimisation problem. Neural network has been successfully applied to solve many optimisation problems, for example TSP. Some of these techniques have been discussed. It is possible that these techniques can also be applied to solve the SMT if a good mapping of the problem to an appropriate network architecture is found. This could be an interesting area for research in the future.
The Steiner minimal tree problem has been studied in the above discussion. A node-splitting algorithm that finds a good heuristic solution to the problem has been developed. Comparison shows that the node-splitting method is comparable to other heuristic methods. In some cases, it is better, for instance, than Korhonen’s algorithm.

Events

Events

Back to top