Suchergebnisse - coding (algorithmsssicssics OR (algorithm OR (algorithm OR algorithm)))

  1. 861

    Multi-qutrit exact synthesis von Kalra, Amolak Ratan, Saikia, Manimugdha, Valluri, Dinesh, Winnick, Sam, Yard, Jon

    Veröffentlicht 2024
    Inhaltsangabe: “… We present an exact synthesis algorithm for qutrit unitaries in $\mathcal{U}_{3^n}(\mathbb{Z}[1/3,e …”
    Volltext
    Preprint
  2. 862

    High dimensional Bayesian Optimization via Condensing-Expansion Projection von Lu, Jiaming, Zhu, Rong J. B.

    Veröffentlicht 2024
    Inhaltsangabe: “… . The random embedding Bayesian optimization algorithm is commonly used to address high-dimensional BO …”
    Volltext
    Preprint
  3. 863

    Super Monotonic Alignment Search von Lee, Junhyeok, Kim, Hyeongju

    Veröffentlicht 2024
    Inhaltsangabe: “… Monotonic alignment search (MAS), introduced by Glow-TTS, is one of the most popular algorithm …”
    Volltext
    Preprint
  4. 864
  5. 865

    Dogfight Search: A Swarm-Based Optimization Algorithm for Complex Engineering Optimization and Mountainous Terrain Path Planning von Sun, Yujing, Cai, Jie, Xu, Xingguo, Gao, Yuansheng, Zhang, Lei, Ouyang, Kaichen, Liu, Zhanyu

    Veröffentlicht 2026
    Inhaltsangabe: “… proposes a novel metaphor-free metaheuristic algorithm called Dogfight Search (DoS). Unlike traditional …”
    Volltext
    Preprint
  6. 866

    Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs von Cheairi, Houssam El, Gamarnik, David

    Veröffentlicht 2024
    Inhaltsangabe: “… on sparse graphs, provided that an algorithm can be coded as a low-degree polynomial (LDP). We illustrate …”
    Volltext
    Preprint
  7. 867

    Teaching Algorithm Design: A Literature Review von Liu, Jonathan, Poulsen, Seth, Goodwin, Erica, Chen, Hongxuan, Williams, Grace, Gertner, Yael, Franklin, Diana

    Veröffentlicht 2024
    Inhaltsangabe: “… , but few research studies focus on pedagogy related to algorithms coursework. To understand the work …”
    Volltext
    Preprint
  8. 868

    Purely periodic continued fractions and graph-directed iterated function systems von Panti, Giovanni

    Veröffentlicht 2023
    Inhaltsangabe: “… We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative …”
    Volltext
    Preprint
  9. 869

    A Comparative Analysis of the Ensemble Methods for Drug Design von Davronova, Rifkat, Adilovab, Fatima

    Veröffentlicht 2020
    Inhaltsangabe: “… individual algorithms. The Python code written to get experimental results in this article has been uploaded …”
    Volltext
    Preprint
  10. 870

    Breaking the Reclustering Barrier in Centroid-based Deep Clustering von Miklautz, Lukas, Klein, Timo, Sidak, Kevin, Leiber, Collin, Lang, Thomas, Shkabrii, Andrii, Tschiatschek, Sebastian, Plant, Claudia

    Veröffentlicht 2024
    Inhaltsangabe: “… This work investigates an important phenomenon in centroid-based deep clustering (DC) algorithms …”
    Volltext
    Preprint
  11. 871

    Modular probabilistic programming with algebraic effects (MSc Thesis 2019) von Goldstein, Oliver, Kammar, Ohad

    Veröffentlicht 2024
    Inhaltsangabe: “… is more difficult, and composing inference algorithms together in code may not necessarily produce correct …”
    Volltext
    Preprint
  12. 872

    Strategic Scaling of Test-Time Compute: A Bandit Learning Approach von Zuo, Bowen, Zhu, Yinglun

    Veröffentlicht 2025
    Inhaltsangabe: “… allocation as a novel bandit learning problem and propose adaptive algorithms that estimate query difficulty …”
    Volltext
    Preprint
  13. 873

    Point Cloud-Based Control Barrier Functions for Model Predictive Control in Safety-Critical Navigation of Autonomous Mobile Robots von Liang, Faduo, Yang, Yunfeng, Dai, Shi-Lu

    Veröffentlicht 2025
    Inhaltsangabe: “… In this work, we propose a novel motion planning algorithm to facilitate safety-critical navigation …”
    Volltext
    Preprint
  14. 874

    Mismatch reconstruction theory for unknown measurement matrix in imaging through multimode fiber bending von Yang, Le

    Veröffentlicht 2025
    Inhaltsangabe: “… bending, resulting in the failure of traditional reconstruction algorithms. This paper presents a novel …”
    Volltext
    Preprint
  15. 875

    QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design von Yang, Rui, Wang, Ziruo, Gu, Yuntian, Chen, Tianyi, Liang, Yitao, Li, Tongyang

    Veröffentlicht 2024
    Inhaltsangabe: “… classical computing through quantum algorithms. However, designing and implementing quantum algorithms pose …”
    Volltext
    Preprint
  16. 876

    Algorithm for transient response of human open‐circuit whole‐room indirect calorimetry: A review and future perspective von Insung Park, Hitomi Ogata, Kumpei Tokuyama

    Veröffentlicht 2025
    Inhaltsangabe: “… be benchmarked against existing algorithms, and the source code should be made publicly available to facilitate …”
    Volltext
    Artículo Open Access
  17. 877

    CrossRT: A cross platform programming technology for hardware-accelerated ray tracing in CG and CV applications von Frolov, Vladimir, Sanzharov, Vadim, Albert, Garifullin, Raenchuk, Maxim, Voloboy, Alexei

    Veröffentlicht 2024
    Inhaltsangabe: “… hardware-accelerated code from hardware-agnostic, object-oriented C++ algorithm descriptions; enabling …”
    Volltext
    Preprint
  18. 878

    PERC: Plan-As-Query Example Retrieval for Underrepresented Code Generation von Yoo, Jaeseok, Han, Hojae, Lee, Youngwon, Kim, Jaejin, Hwang, Seung-won

    Veröffentlicht 2024
    Inhaltsangabe: “… generation accuracy, and (2) converting code into pseudocode effectively captures such algorithmic plans …”
    Volltext
    Preprint
  19. 879
  20. 880

    Decoding Algorithms for Symbol-Error Correction in MDS Array Codes via Superregular Matrices von Zanitti, Débora Beatriz Claro, Teixeira, Isabella Silva, Alves, Carina, Garde, Ivan Aritz Aldaya, Benedito, Cintya Wink de Oliveira

    Veröffentlicht 2026
    Inhaltsangabe: “… algorithms for [n,k,d] MDS array codes, where n=m+k and d=m+1, capable of correcting symbol errors without …”
    Volltext
    Preprint