Risultati della ricerca - coding (Algorithmsssicssics OR (algorithm OR (algorithm OR algorithm)))

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

Sommario: “...We present an exact synthesis algorithm for qutrit unitaries in $\mathcal{U}_{3^n}(\mathbb{Z}[1/3,e...”
Testo

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

Sommario: “.... The random embedding Bayesian optimization algorithm is commonly used to address high-dimensional BO...”
Testo

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

Sommario: “...Monotonic alignment search (MAS), introduced by Glow-TTS, is one of the most popular algorithm...”
Testo

Realization of a Quantum Streaming Algorithm on Long-lived Trapped-ion Qubits di Niroula, Pradeep, Chakrabarti, Shouvanik, Kordonowy, Steven, Kumar, Niraj, Omanakuttan, Sivaprasad, Perlin, Michael A., Allman, M. S., Campora III, J. P., Chernoguzov, Alex, Cooper, Samuel F., Delaney, Robert D., Dreiling, Joan M., Estey, Brian, Figgatt, Caroline, Foltz, Cameron, Gaebler, John P., Hall, Alex, Husain, Ali A., Isanaka, Akhil, Kennedy, Colin J., Kotibhaskar, Nikhil, Madjarov, Ivaylo S., Mills, Michael, Milne, Alistair R., Narmour, Louis, Park, Annie J., Reed, Adam P., Singhal, Kartik, Ransford, Anthony, Bohnet, Justin G., Neyenhuis, Brian, Otter, Rob, Shaydulin, Ruslan

Sommario: “... at a time. In this model, quantum algorithms have been shown to offer an unconditional exponential...”
Testo

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

Sommario: “... proposes a novel metaphor-free metaheuristic algorithm called Dogfight Search (DoS). Unlike traditional...”
Testo

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

Sommario: “... on sparse graphs, provided that an algorithm can be coded as a low-degree polynomial (LDP). We illustrate...”
Testo

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

Sommario: “..., but few research studies focus on pedagogy related to algorithms coursework. To understand the work...”
Testo

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

Sommario: “...We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative...”
Testo

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

Sommario: “... individual algorithms. The Python code written to get experimental results in this article has been uploaded...”
Testo

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

Sommario: “...This work investigates an important phenomenon in centroid-based deep clustering (DC) algorithms...”
Testo

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

Sommario: “... is more difficult, and composing inference algorithms together in code may not necessarily produce correct...”
Testo

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

Sommario: “... allocation as a novel bandit learning problem and propose adaptive algorithms that estimate query difficulty...”
Testo

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

Sommario: “...In this work, we propose a novel motion planning algorithm to facilitate safety-critical navigation...”
Testo

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

Sommario: “... bending, resulting in the failure of traditional reconstruction algorithms. This paper presents a novel...”
Testo

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

Sommario: “... classical computing through quantum algorithms. However, designing and implementing quantum algorithms pose...”
Testo

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

Sommario: “... be benchmarked against existing algorithms, and the source code should be made publicly available to facilitate...”
Testo

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

Sommario: “... hardware-accelerated code from hardware-agnostic, object-oriented C++ algorithm descriptions; enabling...”
Testo

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

Sommario: “... generation accuracy, and (2) converting code into pseudocode effectively captures such algorithmic plans...”
Testo

Unbiased and Error-Detecting Combinatorial Pooling Experiments with Balanced Constant-Weight Gray Codes for Consecutive Positives Detection di He, Guanchen, Kovaleva, Vasilisa A., Barton, Carl, Thomas, Paul G., Pogorelyy, Mikhail V., Meyer, Hannah V., Huang, Qin

Sommario: “... an open-source python package codePub, with implementations of the two core algorithms: a branch-and-bound...”
Testo

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

Sommario: “... algorithms for [n,k,d] MDS array codes, where n=m+k and d=m+1, capable of correcting symbol errors without...”
Testo