رسالة جامعية
Building Maze Solutions with Computational Dreaming
| العنوان: | Building Maze Solutions with Computational Dreaming |
|---|---|
| المؤلفون: | Jackson, Scott Michael |
| مرشدي الرسالة: | Electrical and Computer Engineering, Paul, JoAnn Mary, Silva, Luiz A., Wang, Wen-Li |
| بيانات النشر: | Virginia Tech, 2014. |
| سنة النشر: | 2014 |
| المجموعة: | Virginia Tech Theses and Dissertation |
| Original Material: | vt_gsexam:3498 |
| مصطلحات موضوعية: | Parallel computing, computational dreaming, MISD, bio-inspired computer architecture |
| الوصف: | Modern parallel computing techniques are subject to poor scalability. Their performance tends to suffer diminishing returns and even losses with increasing parallelism. Some methods of intelligent computing, such as neural networks and genetic algorithms, lend themselves well to massively parallel systems but come with other drawbacks that can limit their usefulness such as the requirement of a training phase and/or sensitivity to randomness. This thesis investigates the feasibility of a novel method of intelligent parallel computing by implementing a true multiple instruction stream, single data stream (MISD) computing system that is theoretically nearly perfectly scalable. Computational dreaming (CD) is inspired by the structure and dreaming process of the human brain. It examines previously observed input data during a 'dream phase' and is able to develop and select a simplified model to use during the day phase of computation. Using mazes as an example problem space, a CD simulator is developed and successfully used to demonstrate the viability and robustness of CD. Experiments that focused on CD viability resulted in the CD system solving 15% of mazes (ranging from small and simple to large and complex) compared with 2.2% solved by random model selection. Results also showed that approximately 50% of successful solutions generated match up with those that would be generated by algorithms such as depth first search and Dijkstra's algorithm. Experiments focusing on robustness performed repeated trials with identical parameters. Results demonstrated that CD is capable of achieving this result consistently, solving over 32% of mazes across 10 trials compared to only 3.6% solved by random model selection. A significant finding is that CD does not get stuck on local minima, always converging on a solution model. Thus, CD has the potential to enable significant contributions to computing by potentially finding elegant solutions to, for example, NP-hard or previously intractable problems. Master of Science |
| Original Identifier: | oai:vtechworks.lib.vt.edu:10919/49679 |
| نوع الوثيقة: | Thesis |
| وصف الملف: | ETD; application/pdf |
| الإتاحة: | http://hdl.handle.net/10919/49679Test |
| حقوق: | In Copyright URL: http://rightsstatements.org/vocab/InC/1.0Test/ |
| رقم الانضمام: | edsndl.VTETD.oai.vtechworks.lib.vt.edu.10919.49679 |
| قاعدة البيانات: | Networked Digital Library of Theses & Dissertations |
| الوصف غير متاح. |