Search alternatives:
algorithm spread » algorithm pre (Expand Search), algorithms real (Expand Search), algorithms sorted (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
algorithm npc » algorithm etc (Expand Search), algorithm pca (Expand Search), algorithm _ (Expand Search)
npc function » spc function (Expand Search), gpcr function (Expand Search), fc function (Expand Search)
algorithm spread » algorithm pre (Expand Search), algorithms real (Expand Search), algorithms sorted (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
algorithm npc » algorithm etc (Expand Search), algorithm pca (Expand Search), algorithm _ (Expand Search)
npc function » spc function (Expand Search), gpcr function (Expand Search), fc function (Expand Search)
-
101
-
102
-
103
Swarm intelligence algorithms for width and length on influence games
Published 2021“…<br><br><div>usage: Main.py [-h] [-a] [-r] [-d D] [-t T] [-i I] [-q Q] [--shape SHAPE] [--sym] [--folder FOLDER] [--seed SEED] [--sum SUM] [--mh MH] [--tagsfile TAGSFILE] [--notags] [--prune] [--excludenodes EXCLUDENODES]<br><br>Calculates the best Influence Spread set on a Weighted Symmetric Graph using PSO<br></div><div><br></div><div><div>positional arguments:</div><div> file</div><div><br></div><div>optional arguments:</div><div> -h, --help: show this help message and exit</div><div> -a: threat file input contents as an Adjacency Matrix</div><div> -r: reverse order of nodes, from (a,b,w) a -> b will be b -> a</div><div> -d D: line separator to use while parsing</div><div> -t T: number of times to execute</div><div> -i I: number of metaheuristic iterations per execution</div><div> -q Q: fixed quota, use 0 = floor(n/2)+1</div><div> --shape SHAPE: shape functions for binarization - list of implemented shape functions: s2,s2_neg,v2,v4</div><div> --sym: consider graph as symmetric instead of directed</div><div> --folder FOLDER: output folder</div><div> --seed SEED: use custom seed for metaheuristic calcs</div><div> --sum SUM: adds a value to all node labels</div><div> --mh MH: metaheuristic to use - list of implemented metaheuristics: {1: 'Swarm', 2: 'Swarm2', 3: 'Swarm_W', 4:</div><div> 'Swarm_L'}</div><div> --tagsfile TAGSFILE: use first row as node tags instead of using plurality criteria</div><div> --notags: do not use first row as node tags - tags will be calculated</div><div> --prune: nodes with outdegree = 0 and indegree > 0, and with outdegree = 1 and neighbor's outdegree > 0 will be excluded</div><div> --excludenodes EXCLUDENODES: nodes to skip, comma separated</div></div>…”
-
104
-
105
-
106
-
107
-
108
Deblurring results with different methods on VOC2012 dataset in noisy circumstances.
Published 2020Subjects: -
109
-
110
Friedman and Nemenyi tests of PSNR and SSIM on VOC2012 noise circumstances.
Published 2020Subjects: -
111
-
112
-
113
Friedman and Nemenyi tests of PSNR, SSIM and time on VOC2012 noise-free circumstances.
Published 2020Subjects: -
114
PSNR (dB) and SSIM of the deblurred images in noisy circumstances on VOC2012 database.
Published 2020Subjects: -
115
-
116
-
117
-
118
Estimation accuracy comparison between five methods for two blur parameters.
Published 2020Subjects: -
119
-
120