Showing 1 - 20 results of 12,828 for search '(( algorithm b function ) OR ((( algorithm which function ) OR ( algorithm cell function ))))', query time: 0.99s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

    Brief sketch of the quasi-attraction/alignment algorithm. by Takayuki Niizato (162226)

    Published 2023
    “…The red and black arrows indicate the focal agent and its neighbor, respectively, while the green arrow indicates the next direction. (B) A sketch of the cover function, which returns the minimum cap on the interaction sphere , which covers all points <b><i>p</i></b><sub><i>i</i></sub> (for the mathematical definition, see the Section 2 in <a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1010869#pcbi.1010869.s008" target="_blank">S1 Appendix</a>). …”
  11. 11
  12. 12

    The details of the Scelestial algorithm. by Mohammad-Hadi Foroughmand-Araabi (6658772)

    Published 2022
    “…<p>The inputs to the Scelestial algorithm are a) a set of sequences <i>S</i>, b) the degree of restriction of the restricted Steiner tree <i>k</i>. …”
  13. 13

    Algorithm for generating virtual patients. by Adrianne L. Jenner (11133854)

    Published 2021
    “…<b>4)</b> Optimizing the objective function provides a parameter set for which the patient response to SARS-CoV-2 will be within the physiological ranges. …”
  14. 14
  15. 15

    Continuous Probability Distributions generated by the PIPE Algorithm by LUIS G.B. PINHO (14073372)

    Published 2022
    “…The PIPE algorithm can generate several candidate functions to fit the empirical distribution of data. …”
  16. 16

    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. …”
  17. 17

    A framework for improving localisation prediction algorithms. by Sven B. Gould (12237287)

    Published 2024
    “…One can expect that the combination of multi-dimensional parameters from evolutionary biology, cell biology and molecular biology on evolutionary diverse species will significantly improve the next generation of machine leaning algorithms that serve localisation (and function) predictions.…”
  18. 18

    Flowchart of DAPF-RRT algorithm. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  19. 19

    Performance comparison of different algorithms. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  20. 20