Showing 1 - 20 results of 16,485 for search '(( algorithm state function ) OR ( ((algorithm i) OR (algorithm using)) function ))', query time: 1.11s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5

    Boxplot of fitness in various algorithms. by Wei Liu (20030)

    Published 2023
    “…The convergence of SGWO was analyzed by mathematical theory, and the optimization ability of SGWO and the prediction performance of SGWO-Elman were examined using comparative experiments. The results show: (1) the global convergence probability of SGWO was 1, and its process was a finite homogeneous Markov chain with an absorption state; (2) SGWO not only has better optimization performance when solving complex functions of different dimensions, but also when applied to Elman for parameter optimization, SGWO can significantly optimize the network structure and SGWO-Elman has accurate prediction performance.…”
  6. 6
  7. 7
  8. 8

    Wilcoxon’s test results for EBJADE algorithms and other state-of-the-art CEA-ES algorithms using CEC2014 functions. by Yang Cao (53545)

    Published 2024
    “…<p>Wilcoxon’s test results for EBJADE algorithms and other state-of-the-art CEA-ES algorithms using CEC2014 functions.…”
  9. 9

    Mean training time of different algorithms. by Wei Liu (20030)

    Published 2023
    “…The convergence of SGWO was analyzed by mathematical theory, and the optimization ability of SGWO and the prediction performance of SGWO-Elman were examined using comparative experiments. The results show: (1) the global convergence probability of SGWO was 1, and its process was a finite homogeneous Markov chain with an absorption state; (2) SGWO not only has better optimization performance when solving complex functions of different dimensions, but also when applied to Elman for parameter optimization, SGWO can significantly optimize the network structure and SGWO-Elman has accurate prediction performance.…”
  10. 10

    Algorithm ranking under different dimensions. by Wei Liu (20030)

    Published 2023
    “…The convergence of SGWO was analyzed by mathematical theory, and the optimization ability of SGWO and the prediction performance of SGWO-Elman were examined using comparative experiments. The results show: (1) the global convergence probability of SGWO was 1, and its process was a finite homogeneous Markov chain with an absorption state; (2) SGWO not only has better optimization performance when solving complex functions of different dimensions, but also when applied to Elman for parameter optimization, SGWO can significantly optimize the network structure and SGWO-Elman has accurate prediction performance.…”
  11. 11

    Efficient algorithms to discover alterations with complementary functional association in cancer by Rebecca Sarto Basso (6728921)

    Published 2019
    “…We provide analytic evidence of the effectiveness of UNCOVER in finding high-quality solutions and show experimentally that UNCOVER finds sets of alterations significantly associated with functional targets in a variety of scenarios. In particular, we show that our algorithms find sets which are better than the ones obtained by the state-of-the-art method, even when sets are evaluated using the statistical score employed by the latter. …”
  12. 12
  13. 13

    Data_Sheet_1_SDA: a data-driven algorithm that detects functional states applied to the EEG of Guhyasamaja meditation.docx by Ekaterina Mikhaylets (17865407)

    Published 2024
    “…The SDA was found to be stable with respect to state order organization and showed poor clustering quality metrics and no statistical significance between states when applied to randomly shuffled epochs (i.e., surrogate subject data used as controls). …”
  14. 14
  15. 15

    PATH has state-of-the-art performance versus previous binding affinity prediction algorithms. by Yuxi Long (11024307)

    Published 2025
    “…The only algorithms with non-diagonal ROCs are PATH<sup>−</sup> (AUC=0.696), and the three scoring functions tested with the full AutoDock framework: Vina (AUC=0.69), Smina (AUC=0.71), and Idock (AUC=0.68). …”
  16. 16
  17. 17

    The signal detection algorithm for constructing a neurometric function (the probability of segregation as a function of time) generates acceptable buildup fits at <i>DF</i> = 1, 3, 6, 9. by Quynh-Anh Nguyen (847240)

    Published 2020
    “…Lower panel: The signal detection algorithm constructs neurometric functions using numerical data from all <i>N</i><sub><i>in</i></sub> neuronal units. …”
  18. 18
  19. 19

    Signal detection algorithm adapted from [1] yields exponential distributions and unrealistic mean durations of percepts. by Quynh-Anh Nguyen (847240)

    Published 2020
    “…(Bottom) Trial-by-trial applications of the signal detection algorithm from [<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1008152#pcbi.1008152.ref001" target="_blank">1</a>] with A: <i>C</i><sub><i>th</i></sub> = 4.01 and B: <i>C</i><sub><i>th</i></sub> = 4.21 yield exponentially distributed subsequent percept durations for <i>I</i> (blue) and <i>S</i> (red). …”
  20. 20