( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A novel dynamic Q-learning-based scheduler technique for LTE-advanced technologies using neural networks.

, , , , и . LCN, стр. 332-335. IEEE Computer Society, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Aydin Öztan

Mitat Aydin

Nilüfer Aydin

Yildiz Aydin

Aydin Kaya

 

Другие публикации лиц с тем же именем

Adaptive proportional fair parameterization based LTE scheduling using continuous actor-critic reinforcement learning., , , , , и . GLOBECOM, стр. 4387-4393. IEEE, (2014)Enhancing User Fairness in OFDMA Radio Access Networks Through Machine Learning., , , , , и . Wireless Days, стр. 1-8. IEEE, (2019)A novel dynamic Q-learning-based scheduler technique for LTE-advanced technologies using neural networks., , , , и . LCN, стр. 332-335. IEEE Computer Society, (2012)Scheduling policies based on dynamic throughput and fairness tradeoff control in LTE-A networks., , , , , и . LCN, стр. 418-421. IEEE Computer Society, (2014)Real-time data reconciliation solutions for big data problems observed in oil refineries., , , , , и . SIU, стр. 1612-1615. IEEE, (2014)Reinforcement learning based radio resource scheduling in LTE-advanced., , , , и . ICAC, стр. 219-224. IEEE, (2011)LabDesignAR: configuring multi-camera motion capture systems in augmented reality., , и . VRST, стр. 86:1-86:2. ACM, (2017)A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems., и . EvoCOP, том 3906 из Lecture Notes in Computer Science, стр. 261-271. Springer, (2006)Metaheuristic Agent Teams for Job Shop Scheduling Problems.. HoloMAS, том 4659 из Lecture Notes in Computer Science, стр. 185-194. Springer, (2007)A new orthogonal array based crossover, with analysis of gene interactions, for evolutionary algorithms and its application to car door design., , , , и . Expert Syst. Appl., 37 (5): 3853-3862 (2010)