Showing 821 - 840 results of 5,488 for search 'decision three algorithm', query time: 0.14s Refine Results
  1. 821

    Flood Detection and Susceptibility Mapping Using Sentinel-1 Time Series, Alternating Decision Trees, and Bag-ADTree Models by Ayub Mohammadi, Khalil Valizadeh Kamran, Sadra Karimzadeh, Himan Shahabi, Nadhir Al-Ansari

    Published 2020-01-01
    “…Flooding is one of the most damaging natural hazards globally. During the past three years, floods have claimed hundreds of lives and millions of dollars of damage in Iran. …”
    Get full text
    Article
  2. 822

    Tactical Coordination-Based Decision Making for Unmanned Combat Aerial Vehicles Maneuvering in Within-Visual-Range Air Combat by Yidong Liu, Dali Ding, Mulai Tan, Yuequn Luo, Ning Li, Huan Zhou

    Published 2025-02-01
    “…Compared with decision-making methods based on optimization algorithms and differential games, the win rate is increased by about 17% and 18%, respectively, and the single-step decision-making time is less than 0.02 s, demonstrating high real-time performance and win rate. …”
    Get full text
    Article
  3. 823
  4. 824
  5. 825
  6. 826
  7. 827

    A novel methodological approach to SaaS churn prediction using whale optimization algorithm. by Muhammed Kotan, Ömer Faruk Seymen, Levent Çallı, Sena Kasım, Burcu Çarklı Yavuz, Tijen Över Özçelik

    Published 2025-01-01
    “…The scarcity of research on customer churn models in SaaS, particularly regarding diverse feature selection methods and predictive algorithms, highlights a significant gap. Addressing this would enhance academic discourse and provide essential insights for managerial decision-making. …”
    Get full text
    Article
  8. 828
  9. 829
  10. 830
  11. 831
  12. 832
  13. 833
  14. 834
  15. 835
  16. 836
  17. 837
  18. 838

    Blind recognition of primitive BCH code based on average cosine conformity by Zhaojun WU, Limin ZHANG, Zhaogen ZHONG, Yufeng LONG

    Published 2020-01-01
    “…In order to overcome the poor performance of existing algorithms for recognition of BCH code in low signal-to-noise ratio (SNR),a recognition algorithm based on average cosine conformity was proposed.Firstly,by traversing the possible values of code length and m-level primitive polynomial fields,the code length was identified by matching the initial code roots.Secondly,on the premise of recognizing the code length,the GF(2<sup>m</sup>) domain was traversed under the m-level primitive polynomial and the primitive polynomial with the strongest error-correcting ability was the generator polynomial for the domain.Finally,the minimum common multiple corresponding to the minimum polynomial of code roots was obtained,and the BCH code generator polynomial was recognized.In checking matching,the statistic of average cosine conformity was introduced.The optimal threshold was solved based on the minimum error decision criterion and distribution of the statistic to realize the fast identification of the BCH.The simulation results show that the deduced statistical characteristics are consistent with the actual situation,and the proposed algorithm can achieve reliable recognition under SNR of 5 dB and code length of 511.Comparing with existing algorithms,the performance of the proposed algorithm is better than that of the existing soft-decision algorithm and 1~3.5 dB better than that of the hard-decision algorithms.…”
    Get full text
    Article
  19. 839

    Blind recognition of primitive BCH code based on average cosine conformity by Zhaojun WU, Limin ZHANG, Zhaogen ZHONG, Yufeng LONG

    Published 2020-01-01
    “…In order to overcome the poor performance of existing algorithms for recognition of BCH code in low signal-to-noise ratio (SNR),a recognition algorithm based on average cosine conformity was proposed.Firstly,by traversing the possible values of code length and m-level primitive polynomial fields,the code length was identified by matching the initial code roots.Secondly,on the premise of recognizing the code length,the GF(2<sup>m</sup>) domain was traversed under the m-level primitive polynomial and the primitive polynomial with the strongest error-correcting ability was the generator polynomial for the domain.Finally,the minimum common multiple corresponding to the minimum polynomial of code roots was obtained,and the BCH code generator polynomial was recognized.In checking matching,the statistic of average cosine conformity was introduced.The optimal threshold was solved based on the minimum error decision criterion and distribution of the statistic to realize the fast identification of the BCH.The simulation results show that the deduced statistical characteristics are consistent with the actual situation,and the proposed algorithm can achieve reliable recognition under SNR of 5 dB and code length of 511.Comparing with existing algorithms,the performance of the proposed algorithm is better than that of the existing soft-decision algorithm and 1~3.5 dB better than that of the hard-decision algorithms.…”
    Get full text
    Article
  20. 840

    Detecting Student Engagement in an Online Learning Environment Using a Machine Learning Algorithm by Youssra Bellarhmouch, Hajar Majjate, Adil Jeghal, Hamid Tairi, Nadia Benjelloun

    Published 2025-04-01
    “…We utilized supervised machine learning algorithms to forecast engagement at three levels: quizzes, exams, and lessons, drawing from a Kaggle database. …”
    Get full text
    Article