Number of the records: 1  

nQSV-Net: a novel queuing search variant for global space search and workload modeling

  1. TitlenQSV-Net: a novel queuing search variant for global space search and workload modeling
    Author Nguyen Binh Minh    SCOPUS    RID    ORCID
    Co-authors Hoang Bao

    Nguyen Thieu

    Nguyen Giang 1972- SAVINFO - Ústav informatiky SAV    SCOPUS    RID    ORCID

    Source document Journal of Ambient Intelligence and Humanized Computing. Vol. 12, no. 1 (2021), p. 27-46
    Languageeng - English
    Document kindrozpis článkov z periodík (rbx)
    CitationsLAI, V. - HUANG, Y.F. - KOO, C.H. - AHMED, A.N. - EL-SHAFIE, A. A Review of Reservoir Operation Optimisations: from Traditional Models to Metaheuristic Algorithms. In ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING. ISSN 1134-3060, AUG 2022, vol. 29, no. 5, p. 3435-3457. Dostupné na: https://doi.org/10.1007/s11831-021-09701-8.
    ZHANG, Yue - ZHAI, Yi - XIA, Zhenyang - WANG, Xinlong. A Hybrid Queueing Search and Gradient-Based Algorithm for Optimal Experimental Design. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2023-01-01, 14087 LNCS, pp. 749-760. ISSN 03029743. Dostupné na: https://doi.org/10.1007/978-981-99-4742-3_62.
    CategoryADCA - Scientific papers in foreign journals registered in Current Contents Connect with IF (impacted)
    Category of document (from 2022)V3 - Vedecký výstup publikačnej činnosti z časopisu
    Type of documentčlánok
    Year2021
    Registered inWOS
    Registered inSCOPUS
    Registered inCCC
    DOI 10.1007/s12652-020-02849-4
    article

    article

    File nameAccessSizeDownloadedTypeLicense
    nQSV-Net a novel queuing search variant for global space search and workload modeling.pdfavailable1.8 MB0Publisher's version
    rokCCIFIF Q (best)JCR Av Jour IF PercSJRSJR Q (best)CiteScore
    A
    rok vydaniarok metrikyIFIF Q (best)SJRSJR Q (best)
    202120207.104Q10.589Q1
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.