Showing 1 - 20 results of 4,970 for search '(((( complement system algorithm ) OR ( present _ algorithm ))) OR ( level coding algorithm ))', query time: 0.55s Refine Results
  1. 1

    TreeMap 2016 Stand Size Code Algorithm (Image Service) by U.S. Forest Service (17476914)

    Published 2024
    “…format=iso19139 "> ISO-19139 metadata</a></li><li> <a href="https://data-usfs.hub.arcgis.com/datasets/usfs::treemap-2016-stand-size-code-algorithm-image-service "> ArcGIS Hub Dataset</a></li><li> <a href="https://apps.fs.usda.gov/fsgisx01/rest/services/RDW_ForestEcology/TreeMap_2016_StandSizeCode_Algorithm/ImageServer "> ArcGIS GeoService</a></li></ul><div> For complete information, please visit <a href="https://data.gov">https://data.gov</a>.…”
  2. 2

    Codes for high-order analytical continuation algorithms based on direct derivation and recursion methods by Jian Ma (19747060)

    Published 2024
    “…This study delves into the high-order analytical continuation algorithm, with a particular focus on the computation of its high-order radial derivatives. …”
  3. 3
  4. 4

    The_Code_for_High_Order_Analytical_Continuation by Jian Ma (19747060)

    Published 2024
    “…This study delves into the high-order analytical continuation algorithm, with a particular focus on the computation of its high-order radial derivatives. …”
  5. 5

    Present an algorithm to prove P = NP by Sang-un Lee (22242910)

    Published 2025
    “…NP problem, a long-standing challenge in computer science, we present a novel deterministic algorithm that solves the Hamiltonian path problem, a representative NP-complete problem, in polynomial time. …”
  6. 6
  7. 7
  8. 8

    Present an algorithm to prove P = NP by Sang-un Lee (22242148)

    Published 2025
    “…NP problem, a long-standing challenge in computer science, we present a novel deterministic algorithm that solves the Hamiltonian path problem, a representative NP-complete problem, in polynomial time. …”
  9. 9

    Present an algorithm to prove P = NP by Sang-un Lee (22242055)

    Published 2025
    “…NP problem, a long-standing challenge in computer science, we present a novel deterministic algorithm that solves the Hamiltonian path problem, a representative NP-complete problem, in polynomial time. …”
  10. 10
  11. 11
  12. 12

    Presents the comparison of various density based algorithms. by Shahneela Pitafi (20454775)

    Published 2024
    “…<p>Presents the comparison of various density based algorithms.…”
  13. 13

    Comparison of PDOP values between the present algorithm and the conventional algorithm at 1/4 r/s. by Jiahui Gan (22793753)

    Published 2025
    “…<p>Comparison of PDOP values between the present algorithm and the conventional algorithm at 1/4 r/s.…”
  14. 14
  15. 15
  16. 16

    Open-source code for the Spatial Optimization Model for Land Use (SSFLA-MLAS) by bowen pang (21837359)

    Published 2025
    “…<p dir="ltr">The open-source content is the source code of a land use spatial optimization model (SSFLA-MLAS) that couples the spatial leapfrog algorithm with multi-level multi-agent systems. …”
  17. 17

    Disparities in self-presentation of user’s preferences on algorithm matching. by Linsha Liu (20378293)

    Published 2024
    “…<p>Disparities in self-presentation of user’s preferences on algorithm matching.…”
  18. 18
  19. 19
  20. 20