{"title":"A Neural Network Based Algorithm Selector for Radar Task Scheduling","authors":"Z. Qu, Z. Ding, P. Moo","doi":"10.1109/ICCICC50026.2020.9450265","DOIUrl":null,"url":null,"abstract":"A neural network based algorithm selector, to choose the most appropriate scheduling algorithm, is proposed in this paper. The approach uses the recurrent neural network (RNN) to learn and to select. The earliest start time algorithm and the random shifted start time algorithm, are considered in the RNN. The network is trained with 400,000 samples, and validated with 40,000 samples, resulting in a correct selection rate of 92%. The evaluation is done by numerical simulations, and the result shows an improved overall performance in terms of the schedule cost. The selection approach takes about 11 ms, thus it is practical for real world applications.","PeriodicalId":212248,"journal":{"name":"2020 IEEE 19th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 19th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCICC50026.2020.9450265","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
A neural network based algorithm selector, to choose the most appropriate scheduling algorithm, is proposed in this paper. The approach uses the recurrent neural network (RNN) to learn and to select. The earliest start time algorithm and the random shifted start time algorithm, are considered in the RNN. The network is trained with 400,000 samples, and validated with 40,000 samples, resulting in a correct selection rate of 92%. The evaluation is done by numerical simulations, and the result shows an improved overall performance in terms of the schedule cost. The selection approach takes about 11 ms, thus it is practical for real world applications.