Towards a framework for intuitive programming of cellular automata
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...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | en en |
Published: |
2007
|
Subjects: | |
Online Access: | http://hdl.handle.net/1974/929 |
id |
ndltd-LACETR-oai-collectionscanada.gc.ca-OKQ.1974-929 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-LACETR-oai-collectionscanada.gc.ca-OKQ.1974-9292013-12-20T03:38:35ZTowards a framework for intuitive programming of cellular automataTorbey, SamiCellular automataParallel computingThe 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.Thesis (Master, Computing) -- Queen's University, 2007-12-05 10:26:09.591Queen's University (Kingston, Ont.). Theses (Queen's University (Kingston, Ont.))2007-12-05 10:26:09.5912007-12-05T19:33:24Z2007-12-05T19:33:24Z2007-12-05T19:33:24ZThesis1064087 bytesapplication/pdfhttp://hdl.handle.net/1974/929enenCanadian thesesThis publication is made available by the authority of the copyright owner solely for the purpose of private study and research and may not be copied or reproduced except as permitted by the copyright laws without written authority from the copyright owner. |
collection |
NDLTD |
language |
en en |
format |
Others
|
sources |
NDLTD |
topic |
Cellular automata Parallel computing |
spellingShingle |
Cellular automata Parallel computing Torbey, Sami Towards a framework for intuitive programming of cellular automata |
description |
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. === Thesis (Master, Computing) -- Queen's University, 2007-12-05 10:26:09.591 |
author2 |
Queen's University (Kingston, Ont.). Theses (Queen's University (Kingston, Ont.)) |
author_facet |
Queen's University (Kingston, Ont.). Theses (Queen's University (Kingston, Ont.)) Torbey, Sami |
author |
Torbey, Sami |
author_sort |
Torbey, Sami |
title |
Towards a framework for intuitive programming of cellular automata |
title_short |
Towards a framework for intuitive programming of cellular automata |
title_full |
Towards a framework for intuitive programming of cellular automata |
title_fullStr |
Towards a framework for intuitive programming of cellular automata |
title_full_unstemmed |
Towards a framework for intuitive programming of cellular automata |
title_sort |
towards a framework for intuitive programming of cellular automata |
publishDate |
2007 |
url |
http://hdl.handle.net/1974/929 |
work_keys_str_mv |
AT torbeysami towardsaframeworkforintuitiveprogrammingofcellularautomata |
_version_ |
1716620795820638208 |