Showing 1,961 - 1,980 results of 12,395 for search '(((( algorithm 1 function ) OR ( algorithm wave function ))) OR ( algorithm python function ))', query time: 0.81s Refine Results
  1. 1961
  2. 1962
  3. 1963
  4. 1964
  5. 1965
  6. 1966

    Control signal (<i>v</i><sub>1</sub> by Tuan Anh Nguyen (121944)

    Published 2025
    “…Previous studies often applied only one or several traditional algorithms to control the performance of EPAS systems and ignored the influence of external disturbances. …”
  7. 1967
  8. 1968
  9. 1969
  10. 1970
  11. 1971
  12. 1972
  13. 1973
  14. 1974

    Swarm intelligence algorithms for width and length on influence games by Francisco Muñoz (9455441)

    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>…”
  15. 1975
  16. 1976
  17. 1977
  18. 1978

    Algorithms for continuous and discrete abelian groups and their related classes by Aydin Carus (19420987)

    Published 2024
    “…Taşdemir and A. Carus [<i>A collection of gap algorithms related to continuous and discrete abelian groups</i>. …”
  19. 1979
  20. 1980