File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Optimize cooperative agents with organization in distributed scheduling system
| Title | Optimize cooperative agents with organization in distributed scheduling system |
|---|---|
| Authors | |
| Issue Date | 2006 |
| 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? |
| Abstract | DSAFO (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) × t |
| Persistent Identifier | http://hdl.handle.net/10722/230768 |
| ISSN | 2023 SCImago Journal Rankings: 0.606 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Fan, Wei | - |
| dc.contributor.author | Xue, Fan | - |
| dc.date.accessioned | 2016-09-01T06:06:45Z | - |
| dc.date.available | 2016-09-01T06:06:45Z | - |
| dc.date.issued | 2006 | - |
| dc.identifier.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 | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/230768 | - |
| dc.description.abstract | DSAFO (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.language | eng | - |
| dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
| dc.title | Optimize cooperative agents with organization in distributed scheduling system | - |
| dc.type | Conference_Paper | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.scopus | eid_2-s2.0-33749564331 | - |
| dc.identifier.volume | 4114 LNAI - II | - |
| dc.identifier.spage | 502 | - |
| dc.identifier.epage | 509 | - |
| dc.identifier.eissn | 1611-3349 | - |
| dc.identifier.issnl | 0302-9743 | - |