{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:40:54Z","timestamp":1787017254301,"version":"build-2736575974"},"reference-count":0,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[1997,12]]},"abstract":"<jats:p>The Processor Configuration Problem (PCP) is a real life Constraint Optimization Problem. The task is to link up a finite set of processors into a network, whilst minimizing the maximum distance between these processors. Since each processor has a limited number of communication channels, a carefully planned layout will help reduce the overhead for message switching.<\/jats:p>\n                  <jats:p>In this paper, we present a Genetic Algorithm (GA) approach to the PCP. Our technique uses a mutation-based GA, a function that produces schemata by analyzing previous solutions, and an efficient data representation. Our approach has been shown to out-perform other published techniques in this problem.<\/jats:p>","DOI":"10.1142\/s0218213097000281","type":"journal-article","created":{"date-parts":[[2003,10,22]],"date-time":"2003-10-22T05:26:17Z","timestamp":1066800377000},"page":"567-585","source":"Crossref","is-referenced-by-count":12,"title":["Solving the Processor Configuration Problems with a Mutation-Based Genetic Algorithm"],"prefix":"10.1142","volume":"06","author":[{"given":"T. L.","family":"Lau","sequence":"first","affiliation":[{"name":"University of Essex, Dept. of Computer Science, Wivenhoe Park, Colchester CO4 3SQ, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"E. P. K.","family":"Tsang","sequence":"additional","affiliation":[{"name":"University of Essex, Dept. of Computer Science, Wivenhoe Park, Colchester CO4 3SQ, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213097000281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:15:08Z","timestamp":1565133308000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213097000281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":0,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1997,12]]}},"alternative-id":["10.1142\/S0218213097000281"],"URL":"https:\/\/doi.org\/10.1142\/s0218213097000281","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}