Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/36749
Citations
Scopus Web of ScienceĀ® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLeung, C.-
dc.contributor.authorSum, J.-
dc.contributor.authorShen, H.-
dc.contributor.authorWu, J.-
dc.contributor.authorYoung, G.-
dc.date.issued2004-
dc.identifier.citationCluster Computing, 2004; 7(1):85-90-
dc.identifier.issn1386-7857-
dc.identifier.urihttp://hdl.handle.net/2440/36749-
dc.descriptionThe original publication is available at www.springerlink.com-
dc.description.abstractRecently, agent techniques in electronic marketplaces (e-marketplaces) bring B-to-B trading into a new era. However, not much analysis on the behavior of agents has been reported. In this paper, based on the ant algorithm in network routing, we introduce a jumping (searching) model for agents in an e-marketplace network. However, we should be aware that if there are too many agents in the e-marketplace network, they will use up all communication bandwidth and computing resource. It is inevitable to investigate the behavior of agents, such as agent population. Based on the existing results in the ant algorithm in network routing, we present the behavior of agents in an e-marketplace network. Hence, we can control the agent population by setting the appropriate agent generation rate.-
dc.description.statementofresponsibilityChi Sing Leung, John Pui-fai Sum, Hong Shen, Jie Wu and G. Young-
dc.language.isoen-
dc.publisherSpringer New York LLC-
dc.source.urihttp://www.springerlink.com/content/tw06ln03825x5968/-
dc.subjecte-marketplaces-
dc.subjectagent searching-
dc.subjectant algorithm-
dc.titleAnalysis and design of an agent searching algorithm for e-marketplaces-
dc.typeJournal article-
dc.identifier.doi10.1023/B:CLUS.0000003945.65015.81-
pubs.publication-statusPublished-
dc.identifier.orcidShen, H. [0000-0002-3663-6591] [0000-0003-0649-0648]-
Appears in Collections:Aurora harvest
Computer Science publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.