F. D. C. Gomes, C. N. Meneses, Allan G. Lima, Carlos A. S. Oliveira
{"title":"Asynchronous organizations for solving the point-to-point connection problem","authors":"F. D. C. Gomes, C. N. Meneses, Allan G. Lima, Carlos A. S. Oliveira","doi":"10.1109/ICMAS.1998.699043","DOIUrl":null,"url":null,"abstract":"We present an agent approach to solve the nonfixed point-to-point connection problem. The optimization version of this problem is NP-hard and has numerous applications in circuit switching and VLSI design. We use Asynchronous Teams (or A-Teams) technique to search for an optimal global solution. An A-Team is an organization of agents that communicate with each other by means of shared memories. Each agent is a heuristic strategy that can make its own choices about its inputs, scheduling and resource allocation. Computational results comparing our approach against an exact algorithm are presented.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMAS.1998.699043","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
We present an agent approach to solve the nonfixed point-to-point connection problem. The optimization version of this problem is NP-hard and has numerous applications in circuit switching and VLSI design. We use Asynchronous Teams (or A-Teams) technique to search for an optimal global solution. An A-Team is an organization of agents that communicate with each other by means of shared memories. Each agent is a heuristic strategy that can make its own choices about its inputs, scheduling and resource allocation. Computational results comparing our approach against an exact algorithm are presented.