File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Optimize cooperative agents with organization in distributed scheduling system

TitleOptimize cooperative agents with organization in distributed scheduling system
Authors
Issue Date2006
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2006, v. 4114 LNAI - II, p. 502-509 How to Cite?
AbstractDSAFO (Dynamic Scheduling Agents with Federation Organization) is a novel multi-agent constraint satisfaction algorithm for AGSS problem (a NP-hard scheduling problem). This paper improves on DSAFO by employing a resource requisition strategy, and models this parallel multi-agent algorithm in polyadic π-calculus. The time complexity of the improved DSAFO is O(n3) + O(n2) × ttrans. Experiments show improved DSAFO performs well in AGSS consumptions optimization of resources and man-days. Though it is unstable, improved DSAFO makes good probability to find better solutions than classical heuristics and its distributed and parallel agents viewpoint is potential to deal with distributed dynamic troubles in real applications. © Springer-Verlag Berlin Heidelberg 2006.
Persistent Identifierhttp://hdl.handle.net/10722/230768
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252

 

DC FieldValueLanguage
dc.contributor.authorFan, Wei-
dc.contributor.authorXue, Fan-
dc.date.accessioned2016-09-01T06:06:45Z-
dc.date.available2016-09-01T06:06:45Z-
dc.date.issued2006-
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2006, v. 4114 LNAI - II, p. 502-509-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/230768-
dc.description.abstractDSAFO (Dynamic Scheduling Agents with Federation Organization) is a novel multi-agent constraint satisfaction algorithm for AGSS problem (a NP-hard scheduling problem). This paper improves on DSAFO by employing a resource requisition strategy, and models this parallel multi-agent algorithm in polyadic π-calculus. The time complexity of the improved DSAFO is O(n<sup>3</sup>) + O(n<sup>2</sup>) × t<inf>trans</inf>. Experiments show improved DSAFO performs well in AGSS consumptions optimization of resources and man-days. Though it is unstable, improved DSAFO makes good probability to find better solutions than classical heuristics and its distributed and parallel agents viewpoint is potential to deal with distributed dynamic troubles in real applications. © Springer-Verlag Berlin Heidelberg 2006.-
dc.languageeng-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)-
dc.titleOptimize cooperative agents with organization in distributed scheduling system-
dc.typeConference_Paper-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-33749564331-
dc.identifier.volume4114 LNAI - II-
dc.identifier.spage502-
dc.identifier.epage509-
dc.identifier.eissn1611-3349-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats