De Wilde, Philippe, Lee, L.C. (2001) Avoiding deadlock using pricing strategies for networks of intelligent personal assistants. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. 5. pp. 2899-2904. IEEE, Tucson, AZ ISBN 0-7803-7087-2. (doi:10.1109/ICSMC.2001.971950) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:58052)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: https://10.1109/ICSMC.2001.971950 |
Abstract
A pricing strategy for networks of intelligent personal assistants (PA) was presented to avoid deadlocking in large-scale distributed systems. The proposed strategy used marketing mechanisms to allocate the time slot of the PA's. The PA performed resource allocation in microeconomic sense and predicted the missing information. Analysis suggested that the PA performed accounting by pricing resources and time as well as helped to improve intelligent time management.
Item Type: | Conference or workshop item (Proceeding) |
---|---|
DOI/Identification number: | 10.1109/ICSMC.2001.971950 |
Uncontrolled keywords: | Computer system recovery; Data acquisition; Distributed computer systems; Fuzzy sets; Intelligent agents; Intelligent networks; Large scale systems; Mathematical models; Resource allocation, Intelligent personal assistants, Personal digital assistants |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Philippe De Wilde |
Date Deposited: | 20 Dec 2022 09:31 UTC |
Last Modified: | 05 Nov 2024 10:49 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/58052 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):