|
QSpace at Queen's University >
Theses & Dissertations >
Queen's Theses & Dissertations >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1974/929
|
| Title: | Towards a framework for intuitive programming of cellular automata |
| Author: | Torbey, Sami |
Files in This Item:
| File |
Description |
Size | Format |
|---|
| Torbey_Sami_200712_MSc.pdf | | 1039Kb | Adobe PDF | View/Open |
|
|
| Keywords: | Cellular automata
Parallel computing |
| Issue Date: | 5-Dec-2007 |
| Series/Report no.: | Canadian theses |
| Abstract: | The ability to obtain complex global behaviour from simple local rules makes cellular automata an interesting platform for massively parallel computation. However, manually designing a cellular automaton to perform a given computation can be extremely tedious, and automated design techniques such as genetic programming have their limitations because of the absence of human intuition. In this thesis, we propose elements of a framework whose goal is to make the manual synthesis of cellular automata rules exhibiting desired global characteristics more programmer-friendly, while maintaining the simplicity of local processing elements. We also demonstrate the power of that framework by using it to provide intuitive yet effective solutions to the two-dimensional majority classification problem, the convex hull of disconnected points problem, and various problems pertaining to node placement in wireless sensor networks. |
| Description: | Thesis (Master, Computing) -- Queen's University, 2007-12-05 10:26:09.591 |
| URI: | http://hdl.handle.net/1974/929 |
| Appears in Collections: | Queen's Theses & Dissertations
Computing Graduate Theses
|
All items in QSpace are protected by copyright, with all rights reserved.
|
