Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö ¼ÒÇÁÆ®¿þ¾î ¹× µ¥ÀÌÅÍ °øÇÐ
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
ÀÏÂ÷¿ø ¼¿·ê·¯ ¿ÀÅ丶Ÿ »ó¿¡¼ ÁøÈ ¾Ë°í¸®ÁòÀ» ÀÌ¿ëÇÑ »óÅÂÀüÀÌÇÔ¼ö ã±â |
¿µ¹®Á¦¸ñ(English Title) |
Finding State Transition Functions of One-Dimensional Cellular Automata by Evolutionary Algorithms |
ÀúÀÚ(Author) |
¹ÚÁ¾¿ì
¿Õ¼¼Èñ
À§±Ô¹ü
Jongwoo Park
Sehee Wang
Kyubum Wee
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 08 NO. 05 PP. 0187 ~ 0192 (2019. 05) |
Çѱ۳»¿ë (Korean Abstract) |
ÀÏÂ÷¿ø ¼¿·ê·¯ ¿ÀÅ丶Ÿ(CA)¿¡¼ °ú¹Ý¼ö ¹®Á¦(majority problem)¿Í µ¿±âÈ ¹®Á¦(synchronization problem)´Â ±¹¼Ò Á¤º¸(local information)¸¦ ÀÌ¿ëÇÏ¿© Àü¿ª ¹®Á¦(global problem)¸¦ Ç®¾î¾ß ÇÏ´Â °è»êÀûÀ¸·Î ¾î·Á¿î ¹®Á¦ÀÌ´Ù. º» ³í¹®¿¡¼´Â ÀÏÂ÷¿ø CA¿¡¼ °ú¹Ý¼ö ¹®Á¦¿Í µ¿±âÈ ¹®Á¦¸¦ Ǫ´Â CAÀÇ ±ÔÄ¢À» ã´Â ¹æ¹ýÀ» Á¦¾ÈÇÑ´Ù. CAÀÇ »óÅÂÀüÀÌ ÇÔ¼ö(state transition function)¸¦ ÀϹÝÀûÀ¸·Î »ç¿ëÇÏ´Â ±ÔĢǥ(rule table)°¡ ¾Æ´Ñ Á¶°ÇºÎ ¸ÅĪ ±ÔÄ¢(CMR)À¸·Î ³ªÅ¸³»°í ÁøÈ ¾Ë°í¸®ÁòÀ» Àû¿ëÇÏ¿´´Ù. °¢ ¹®Á¦¿¡¼ ´Ù¼öÀÇ ±ÔÄ¢µéÀ» ã¾Æ³»¾î Á¦¾ÈÇÑ ¹æ¹ýÀ» È¿°úÀûÀ¸·Î »ç¿ëÇÒ ¼ö ÀÖÀ½À» º¸¿´´Ù. ¶ÇÇÑ ÀÌÀü ¿¬±¸ °á°ú¿Í ºñ±³ÇÏ¿© °ú¹Ý¼ö ¹®Á¦¿Í µ¿±âÈ ¹®Á¦¿¡¼ CMRÀ» »ç¿ëÇÏ´Â ¹æ½ÄÀÇ È¿¿ë¼ºÀ» º¸¿´À¸¸ç, ´Ù¸¥ ÀÏÂ÷¿ø CA¹®Á¦¿¡µµ CMRÀ» È°¿ëÇÒ ¼ö ÀÖ´Â °¡´É¼ºÀ» º¸¿´´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
Majority problem and synchronization problem on cellular automata(CA) are hard to solve, since they are global problems while CA operate on local information. This paper proposes a way to find state transition rules of these problems. The rules of CA are represented as CMR(conditionally matching rules) and evolutionary algorithms are applied to find rules. We find many solution rules to these problems, compared the results with the previous studies, and demonstrated the effectiveness of CMR on one-dimensional cellular automata.
|
Å°¿öµå(Keyword) |
¼¿·ê·¯ ¿ÀÅ丶Ÿ
°ú¹Ý¼ö ¹®Á¦
µ¿±âÈ ¹®Á¦
ÁøÈ ¾Ë°í¸®Áò
Á¶°ÇºÎ ¸ÅĪ ±ÔÄ¢
Cellular Automata
Majority Problem
Synchronization Problem
Evolutionary Algorithms
Conditionally Matching Rules
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|