يعرض 1,821 - 1,840 نتائج من 15,643 نتيجة بحث عن '(( algorithm a function ) OR ((( algorithm python function ) OR ( algorithm fibrin function ))))', وقت الاستعلام: 0.36s تنقيح النتائج
  1. 1821
  2. 1822
  3. 1823
  4. 1824
  5. 1825
  6. 1826
  7. 1827
  8. 1828
  9. 1829
  10. 1830
  11. 1831
  12. 1832
  13. 1833

    BioJupiter interface and functionalities.pdf حسب Paul A. Gagniuc (1818325)

    منشور في 2022
    "…BioJupiter interface and functionalities. (a-c) The application interface. (a) main heatmap, (b) the main alignment result, (c) the local storage browser and disk operations. …"
  14. 1834
  15. 1835
  16. 1836
  17. 1837

    Network Gradient Descent Algorithm for Decentralized Federated Learning حسب Shuyuan Wu (57425)

    منشور في 2022
    "…<p>We study a fully decentralized federated learning algorithm, which is a novel gradient descent algorithm executed on a communication-based network. …"
  18. 1838

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

    منشور في 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>…"
  19. 1839

    Algorithms for continuous and discrete abelian groups and their related classes حسب Aydin Carus (19420987)

    منشور في 2024
    "…The algorithms are implemented and published as a collection of GAP4 functions named <b>codiaga</b> (see Ö. …"
  20. 1840