Asynchronous organizations for solving the point-to-point connection problem

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.
异步组织用于解决点对点连接问题
提出了一种求解非固定点对点连接问题的智能体方法。该问题的优化版本是np困难的,在电路开关和VLSI设计中有许多应用。我们使用异步团队(或A-Teams)技术来搜索最优的全局解决方案。A-Team是一个由特工组成的组织,他们通过共享记忆相互沟通。每个代理都是一种启发式策略,可以对其输入、调度和资源分配做出自己的选择。给出了与精确算法比较的计算结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信