| Call No. |
Research Topics |
| Description |
1 PDF (xi, 36 pages) : illustrations |
| Content Type |
text |
| Media Type |
computer |
| Carrier Type |
online resource |
| Description |
text file PDF rda |
| Thesis |
Master Holy Spirit University of Kaslik (USEK) 2019. |
| Note |
Department: Department of Computer Science. |
|
Advisor: Bachir Habib. |
| Bibliography |
Includes bibliographical references (pages 67-77). |
| Note |
Available online via USEK Digital Gate. |
| Summary |
Programmable matter, the general term usually used to define a set of computational elements, also known as particles, placed in an infinite graph. Those particles have the ability to self-organize for the purpose of resolving certain essential problems relevant for programmable matter with any outside interference. As for the model, we will use the geometric Ameobot model, which defines how the particles can move, create and release bonds between each other in the scope of a hexagonal tessellation of the plane. One of the fundamental problems of programmable matter is the leader election problem, which consists of choosing one of the particles as the leader, in order to facilitate the coordination of the movements between the particles in later phases. In this paper, we provide a new efficient algorithm that can help in reducing the complexity of this process considerably. |
| Subject |
Holy Spirit University of Kaslik (USEK) -- Dissertations, Academic
|
| Genre/Form |
Dissertations, Academic -- Computer Science Holy Spirit University of Kaslik (USEK)
|
| Indexed Term |
Programmable Matter |
|
Particles |
|
Self-Organize |
|
Ameobot |
|
Leader Election |
| Added Author |
Habib, Bachir, Supervisor.
|
|
Holy Spirit University of Kaslik (Lebanon). Faculty of Sciences, degree granting institution.
|
|
Permanent Link
