Search alternatives:
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
algorithm t4p » algorithm steps (Expand Search), algorithm setup (Expand Search), algorithm _ (Expand Search)
t4p function » step function (Expand Search), _ function (Expand Search), 1 function (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (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)
algorithm t4p » algorithm steps (Expand Search), algorithm setup (Expand Search), algorithm _ (Expand Search)
t4p function » step function (Expand Search), _ function (Expand Search), 1 function (Expand Search)
algorithm a » algorithm _ (Expand Search), algorithm b (Expand Search), algorithms _ (Expand Search)
a function » _ function (Expand Search)
-
81
-
82
Swarm intelligence algorithms for multi-objective max-min-ISP
Published 2023“…<p>Algorithms implemented on article "<strong>On the max-min influence spread problem: A multi-objective optimization approach</strong>"</p> <p><br></p> <p>usage: Main.py [-h] [-a] [-r] [-d D] [-t T] [-i I] [-q Q] [--shape SHAPE] [--sym] [--folder FOLDER] [--seed SEED] [--spread SPREAD] [--sum SUM] [--mh MH] [--tagsfile TAGSFILE] [--notags] [--prune] [--prunelowdeg] [--excludenodes EXCLUDENODES] [--includeindegzero] [--nodepthcriteria] [--memfile MEMFILE] file</p> <p><br></p> <p>Calculates the best Influence Spread set on a Weighted Graph using PSO</p> <p><br></p> <p>positional arguments:</p> <p>file</p> <p><br></p> <p>options:</p> <p>-h, --help: show this help message and exit</p> <p>-a: read file input contents as an Adjacency Matrix</p> <p>-r: reverse nodes order, reads (b,a,w) instead of (a,b,w)</p> <p>-d D: line separator to use on file parsing</p> <p>-t T: number of times to execute this solver</p> <p>-i I: number of metaheuristic iterations per execution</p> <p>-q Q: fixed quota, use 0 = floor(n/2)+1</p> <p>--shape SHAPE: shape functions for binarization - list of implemented shape functions: s2, s2_neg, v2, v4</p> <p>--sym: consider graph as symmetric instead of directed</p> <p>--folder FOLDER: output folder</p> <p>--seed SEED: use custom seeds for metaheuristic pseudo RNG</p> <p>--spread SPREAD: use specific influence spread model funcion - list of implemented models: LT, IC</p> <p>--sum SUM: adds an extra value to all edge's weight</p> <p>--mh MH: metaheuristic to use - list of implemented metaheuristics: 1 (Swarm3), 3 (Swarm3_W), 4 (Swarm3_L), 5 (Swarm4)</p> <p>--tagsfile TAGSFILE: use first row as node tags instead of using plurality criteria</p> <p>--notags: do not use first row as node tags, instead tags will be calculated</p> <p>--prune: nodes with (1) outdegree = 0 and indegree > 0, and (2) with outdegree = 1 and neighbor's outdegree > 0 will be excluded</p> <p>--prunelowdeg: nodes with low outdegree or degree will be excluded</p> <p>--excludenodes EXCLUDENODES: nodes to skip, must be comma separated</p> <p>--includeindegzero: forces to include nodes with indegree = 0 on all executions</p> <p>--nodepthcriteria: particles will not tie off with spread depth in case of having same fitness and spread</p> <p>--memfile MEMFILE: memory dump of other execution</p>…”
-
83
Algorithmic assessment reveals functional implications of GABRD gene variants linked to idiopathic generalized epilepsy
Published 2024“…</p> <p>The study employs a combination of in silico algorithms to analyze 82 variants of unknown clinical significance of GABRD gene sourced from the ClinVar database. …”
-
84
A hybrid algorithm based on improved threshold function and wavelet transform.
Published 2024“…<p>A hybrid algorithm based on improved threshold function and wavelet transform.…”
-
85
-
86
The PS of ten comparative algorithms on the MMF14a Test Function.
Published 2025“…<p>The PS of ten comparative algorithms on the MMF14a Test Function.</p>…”
-
87
-
88
Flowchart of proposed fitness function algorithm.
Published 2025“…The mathematical model was transformed into a fitness function and a solution was provided with the Tabu Search Algorithm and Simulated Annealing. …”
-
89
Function graph and algorithm iterative graph.
Published 2024“…According to the encouraging research results in this paper, the IERWHO algorithm proposed has a place in the field of optimization.…”
-
90
-
91
BOFdat: Generating biomass objective functions for genome-scale metabolic models from experimental data
Published 2019“…Despite its importance, no standardized computational platform is currently available to generate species-specific biomass objective functions in a data-driven, unbiased fashion. To fill this gap in the metabolic modeling software ecosystem, we implemented BOFdat, a Python package for the definition of a <b>B</b>iomass <b>O</b>bjective <b>F</b>unction from experimental <b>dat</b>a. …”
-
92
-
93
Improved A* algorithm flowchart.
Published 2024“…Specifically, A-star is optimized by evaluation function, sub node selection mode and path smoothness, and fuzzy control is introduced to optimize the sliding window algorithm. …”
-
94
Codes of the flow distance algorithm "D∞-TLI" and the width function algorithm "MEB"
Published 2023“…<p>The JAVA codes of the flow distance algorithm "D∞-TLI" and the width function algorithm "MEB" are provided. …”
-
95
-
96
Performance as a function of the number of algorithm executions for the full-sized matrix design.
Published 2020“…<p>Performance as a function of the number of algorithm executions for the full-sized matrix design.…”
-
97
-
98
-
99
Dataset of networks used in assessing the Troika algorithm for clique partitioning and community detection
Published 2025“…Each network is provided in .gml format or .pkl format which can be read into a networkX graph object using standard functions from the networkX library in Python. …”
-
100
Search Algorithms and Loss Functions for Bayesian Clustering
Published 2022“…<p>We propose a randomized greedy search algorithm to find a point estimate for a random partition based on a loss function and posterior Monte Carlo samples. …”