Search alternatives:
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
from function » from functional (Expand Search), fc function (Expand Search)
a function » _ function (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
from function » from functional (Expand Search), fc function (Expand Search)
a function » _ function (Expand Search)
-
41
Efficient algorithms to discover alterations with complementary functional association in cancer
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. …”
-
42
Practical rules for summing the series of the Tweedie probability density function with high-precision arithmetic
Published 2019“…These implementations need to utilize high-precision arithmetic, and are programmed in the Python programming language. A thorough comparison with existing R functions allows the identification of cases when the latter fail, and provide further guidance to their use.…”
-
43
-
44
-
45
-
46
-
47
Test function information.
Published 2023“…A levy flight strategy further improves the algorithm’s ability to jump out of local minima. …”
-
48
-
49
-
50
Test function results.
Published 2025“…Finally, the Cauchy-Gaussian mutation strategy is utilized to prevent the algorithm from falling into local traps. These three steps enable LLSKSO to achieve a dynamic balance between local and global search. …”
-
51
Benchmark test functions.
Published 2025“…Finally, the Cauchy-Gaussian mutation strategy is utilized to prevent the algorithm from falling into local traps. These three steps enable LLSKSO to achieve a dynamic balance between local and global search. …”
-
52
S1 File -
Published 2024“…In this study, we developed a computerized algorithm using the python package (pdfplumber) and validated against clinicians’ interpretation. …”
-
53
S1 Dataset -
Published 2024“…In this study, we developed a computerized algorithm using the python package (pdfplumber) and validated against clinicians’ interpretation. …”
-
54
-
55
Efficient Algorithms for GPU Accelerated Evaluation of the DFT Exchange-Correlation Functional
Published 2025“…Two approaches, both leveraging batched dense linear algebra, are found to outperform the others across a suite of molecular benchmarks. We show that batched formation of the XC matrix from the density matrix yields the best performance for large (>O(103) basis functions), sparse systems such as glycine chains and water clusters. …”
-
56
-
57
CEC2017 basic functions.
Published 2025“…<div><p>To address the limitations of the Zebra Optimization Algorithm (ZOA), including insufficient late-stage optimization search capability, susceptibility to local optima, slow convergence, and inadequate exploration, this paper proposes an enhanced Zebra Optimization Algorithm integrating opposition-based learning and a dynamic elite-pooling strategy (OP-ZOA: Opposition-Based Learning Dynamic Elite-Pooling Zebra Optimization Algorithm). he proposed search algorithm employs a good point set-elite opposition-based learning mechanism to initialize the population, enhancing diversity and facilitating escape from local optima. …”
-
58
-
59
-
60