Hybrid genetic hill-climbing algorithm for four-colouring map optimisation
The objective of an n-region 4-colouring map problem is to colour the regions in the map such that the adjacent regions (sharing a common boundary) are coloured differently to distinguish the different regions and complete the colouring in the shortest (computation) time possible.
محفوظ في:
المؤلف الرئيسي: | |
---|---|
مؤلفون آخرون: | |
التنسيق: | Theses and Dissertations |
منشور في: |
2008
|
الموضوعات: | |
الوصول للمادة أونلاين: | http://hdl.handle.net/10356/4664 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Nanyang Technological University |
id |
sg-ntu-dr.10356-4664 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-46642023-07-04T16:00:03Z Hybrid genetic hill-climbing algorithm for four-colouring map optimisation Lim, Heng Won. Gwee, Bah Hwee School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems The objective of an n-region 4-colouring map problem is to colour the regions in the map such that the adjacent regions (sharing a common boundary) are coloured differently to distinguish the different regions and complete the colouring in the shortest (computation) time possible. Master of Science (Consumer Electronics) 2008-09-17T09:56:11Z 2008-09-17T09:56:11Z 2003 2003 Thesis http://hdl.handle.net/10356/4664 Nanyang Technological University application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
topic |
DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems |
spellingShingle |
DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems Lim, Heng Won. Hybrid genetic hill-climbing algorithm for four-colouring map optimisation |
description |
The objective of an n-region 4-colouring map problem is to colour the regions in the map such that the adjacent regions (sharing a common boundary) are coloured differently to distinguish the different regions and complete the colouring in the shortest (computation) time possible. |
author2 |
Gwee, Bah Hwee |
author_facet |
Gwee, Bah Hwee Lim, Heng Won. |
format |
Theses and Dissertations |
author |
Lim, Heng Won. |
author_sort |
Lim, Heng Won. |
title |
Hybrid genetic hill-climbing algorithm for four-colouring map optimisation |
title_short |
Hybrid genetic hill-climbing algorithm for four-colouring map optimisation |
title_full |
Hybrid genetic hill-climbing algorithm for four-colouring map optimisation |
title_fullStr |
Hybrid genetic hill-climbing algorithm for four-colouring map optimisation |
title_full_unstemmed |
Hybrid genetic hill-climbing algorithm for four-colouring map optimisation |
title_sort |
hybrid genetic hill-climbing algorithm for four-colouring map optimisation |
publishDate |
2008 |
url |
http://hdl.handle.net/10356/4664 |
_version_ |
1772827334115590144 |