| dc.contributor | 資科系 | |
| dc.creator (作者) | Liu, Jyi-shane;Hung, Pei-Chun;Lee, Ching-Ying | |
| dc.creator (作者) | 劉吉軒 | zh_TW |
| dc.date (日期) | 1994 | |
| dc.date.accessioned | 17-Jun-2015 16:42:29 (UTC+8) | - |
| dc.date.available | 17-Jun-2015 16:42:29 (UTC+8) | - |
| dc.date.issued (上傳時間) | 17-Jun-2015 16:42:29 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/75917 | - |
| dc.description.abstract (摘要) | We present a methodology, called Constraint Partition and Coordinated Reaction (CP&CR), for collective, evolutionary problem solving. Problem solving is viewed as an emergent functionality from the evolving process of a group of diverse, interacting, and well-coordinated reactive agents. Cheap and effective search knowledge is extracted from local interactions and embedded in the coordination mechanism. Our domain of problem solving is constraint satisfaction problems. We have applied the methodology to job shop scheduling, an NP-complete constraint satisfaction problem. Experimental results on a benchmark suite of problems show that CP&CR outperformed three other state-of-the-art direct search scheduling techniques, in both efficiency and number of problems solved. In addition, CP&CR was experimentally tested on problems of larger sizes and showed favorable scaling-up characteristics | |
| dc.format.extent | 129 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | International Conference on Evolutionary Computation , pp. 575-578 | |
| dc.title (題名) | Collective Problem Solving Through Coordinated Reaction | |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1109/ICEC.1994.349996 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/ICEC.1994.349996 | |
