Showing 101 - 120 results of 2,037 for search '(( algorithm python function ) OR ((( algorithm spread function ) OR ( algorithm co function ))))', query time: 0.38s Refine Results
  1. 101

    Optional pipe diameter and unit price of NYN. by Yi Tao (178829)

    Published 2022
    Subjects: “…evolutionary genetic algorithm…”
  2. 102

    Optional pipe diameter and unit price of HN. by Yi Tao (178829)

    Published 2022
    Subjects: “…evolutionary genetic algorithm…”
  3. 103

    The topology of HN. by Yi Tao (178829)

    Published 2022
    Subjects: “…evolutionary genetic algorithm…”
  4. 104

    Information of nodes and pipes of HN. by Yi Tao (178829)

    Published 2022
    Subjects: “…evolutionary genetic algorithm…”
  5. 105
  6. 106
  7. 107

    Practical rules for summing the series of the Tweedie probability density function with high-precision arithmetic by NELSON L. DIAS (8078003)

    Published 2019
    “…With these practical rules, simple summation algorithms provide sufficiently robust results for the calculation of the density function and its definite integrals. …”
  8. 108
  9. 109
  10. 110

    Simultaneous point-spread function optimization in two optical arms with a single deformable mirror. by nikita vladimirov (9726569)

    Published 2021
    “…The two point-spread functions (PSFs) correspond to the same fluorescent bead, as seen in two orthogonal views of the microscope. …”
  11. 111
  12. 112
  13. 113
  14. 114
  15. 115
  16. 116

    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>…”
  17. 117
  18. 118
  19. 119
  20. 120