Showing 121 - 140 results of 511 for search '(((( algorithm spread function ) OR ( algorithm npc function ))) OR ( algorithm python function ))', query time: 0.34s Refine Results
  1. 121
  2. 122
  3. 123
  4. 124

    Swarm intelligence algorithms for multi-objective max-min-ISP by Francisco Muñoz (9455441)

    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>…”
  5. 125
  6. 126
  7. 127
  8. 128
  9. 129
  10. 130
  11. 131

    Swarm intelligence algorithms for multi-objective IMP: Step-by-step improvement by Francisco Muñoz (9455441)

    Published 2022
    “…Algorithms implemented on article "<b>A step-by-step solution for the multi-objective influence spread problem</b>". …”
  12. 132

    Parselmouth for bioacoustics: automated acoustic analysis in Python by Yannick Jadoul (11498813)

    Published 2023
    “…Five years ago, the Python package Parselmouth was released to provide easy and intuitive access to all functionality in the Praat software. …”
  13. 133

    Summary: Dipole-spread-function engineering for simultaneously measuring the 3D orientations and 3D positions of fluorescent molecules by Tingting Wu (21440889)

    Published 2025
    “…However, spatial and angular information are mixed within the image of a fluorescent molecule–the microscope’s dipole-spread function (DSF). We demonstrate the pixOL algorithm to simultaneously optimize all pixels within a phase mask to produce an engineered Green’s tensor–the dipole extension of point-spread function engineering. …”
  14. 134
  15. 135
  16. 136
  17. 137
  18. 138
  19. 139
  20. 140