.png){kind=icon}
Return
A note on the learning effect in multi-agent optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2010.11.024.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we point out that the learning effect, in the form known from industrial systems or services sectors, takes place in multi-agent optimization. In particular, we show that the minimization of a total transmission cost of packets in a computer network that uses a reinforcement learning routing algorithm can be expressed as the single machine makespan minimization scheduling problem with the learning effect. On this basis, we prove this problem is at least NP-hard (even off-line version). However, we derive properties, which allow us to construct on-line scheduling algorithms that can be applied in the computer network to increase its efficiency by the utilization of its learning ability. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
Scheduling
Learning effect
Reinforcement learning
Routing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
Cited Papers
ShareSaveLipid Droplet Accumulation Independently Predicts Poor Clinical Prognosis in High-Grade Serous Ovarian Carcinoma.png)
Cancers
OAAI
CancersIF0
OAAIShareSaveThe Ether Lipid Inositol‐C2‐PAF is a Potent Inhibitor of Cell Proliferation in HaCaT CellsChemBioChem
ChemBioChemIF0
PREAI
ShareSave
View more