Risultati della ricerca - coding ((algorithmics OR (algorithm OR algorithm)) OR (algorithm OR Algorithmssssics))

Code Simulation Challenges for Large Language Models di La Malfa, Emanuele, Weinhuber, Christoph, Torre, Orazio, Lin, Fangru, Marro, Samuele, Cohn, Anthony, Shadbolt, Nigel, Wooldridge, Michael

Sommario: “... extent Large Language Models (LLMs) can simulate coding and algorithmic tasks to provide insights...”
Testo

QC Lab: A Python Package for Quantum-Classical Dynamics di Krotz, Alex, Byrd, Ethan, Miyazaki, Ken, Tempelaar, Roel

Sommario: “... the development of QC algorithms, and their application to a wide variety of relevant model problems. It follows a...”
Testo

Minimal Trellises for non-Degenerate and Degenerate Decoding of Quantum Stabilizer Codes di Stylianou, Evagoras, Sidorenko, Vladimir, Deppe, Christian, Boche, Holger

Sommario: “... and degenerate decoding of quantum stabilizer codes. For non-degenerate decoding, various strategies are explored...”
Testo

Time-Series Forecasting in Smart Manufacturing Systems: An Experimental Evaluation of the State-of-the-art Algorithms di Farahani, Mojtaba A., Kalach, Fadi El, Harper, Austin, McCormick, M. R., Harik, Ramy, Wuest, Thorsten

Sommario: “... were conducted to assess the significance of observed differences. Only algorithms with codes from open...”
Testo

Subset Sum in Near-Linear Pseudopolynomial Time and Polynomial Space di Sajith, Thejas Radhika

Sommario: “... programming algorithm runs in $O(nt)$ time and $O(t)$ space. Since then, much work has been done to reduce...”
Testo

Log-Log Domain Sum-Product Algorithm for Information Reconciliation in Continuous-Variable Quantum Key Distribution di Cil, Erdem Eray, Schmalen, Laurent

Sommario: “...In this paper, we present a novel log-log domain sum-product algorithm (SPA) for decoding low...”
Testo

RAPID: An Efficient Reinforcement Learning Algorithm for Small Language Models di Huang, Lianghuan, Anupam, Sagnik, Lee, Insup, Li, Shuo, Bastani, Osbert

Sommario: “... models (SLMs) to solve targeted tasks such as math and coding. However, RL algorithms tend to be resource...”
Testo

SciReplicate-Bench: Benchmarking LLMs in Agent-driven Algorithmic Reproduction from Research Papers di Xiang, Yanzheng, Yan, Hanqi, Ouyang, Shuyin, Gui, Lin, He, Yulan

Sommario: “...This study evaluates large language models (LLMs) in generating code from algorithm descriptions...”
Testo

Estimating the Weight Enumerators of Reed-Muller Codes via Sampling di Jain, Shreyas, Rameshwar, V. Arvind, Kashyap, Navin

Sommario: “... of Reed-Muller (RM) codes. Our algorithm is based on a technique for estimating the partition functions...”
Testo

Classical-Quantum Channel Resolvability Using Matrix Multiplicative Weight Update Algorithm di Takahashi, Koki, Watanabe, Shun

Sommario: “... by deterministic coding, using multiplicative weight update algorithm. We extend this approach to C-Q channels...”
Testo

Crucible: Quantifying the Potential of Control Algorithms through LLM Agents di Jia, Lianchen, Li, Chaoyang, Houde, Qian, Huang, Tianchi, Liu, Jiangchuan, Sun, Lifeng

Sommario: “...Control algorithms in production environments typically require domain experts to tune...”
Testo

Deep-Learning-Aided Successive Cancellation List Flip Decoding for Polar Codes di Liang, Fu-Siang, Lu, Shan, Ueng, Yeong-Luh

Sommario: “... on infinite code length. The Successive Cancellation List Flip (SCLF) decoding algorithm was proposed...”
Testo

Decoding Algorithms for Tensor Codes di Byrne, Eimear, Couvreur, Alain, François, Lucien

Sommario: “...Tensor codes are a generalisation of matrix codes. Such codes are defined as subspaces of order-r...”
Testo

Designing Network Algorithms via Large Language Models di He, Zhiyuan, Gottipati, Aashish, Qiu, Lili, Luo, Xufang, Xu, Kenuo, Yang, Yuqing, Yan, Francis Y.

Sommario: “...We introduce NADA, the first framework to autonomously design network algorithms by leveraging...”
Testo

ADDQ: Adaptive Distributional Double Q-Learning di Döring, Leif, Wille, Benedikt, Birr, Maximilian, Bîrsan, Mihail, Slowik, Martin

Sommario: “... of $Q$-learning and actor-critic methods. One of the reasons of the success of modern RL algorithms...”
Testo

Fairness and Sum-Rate Maximization via Joint Channel and Power Allocation in Uplink SCMA Networks di Evangelista, Joao V. C., Sattar, Zeeshan, Kaddoum, Georges, Chaaban, Anas

Sommario: “...In this work, we consider a sparse code multiple access uplink system, where $J$ users...”
Testo

Structure-based Drug Design Benchmark: Do 3D Methods Really Dominate? di Zheng, Kangyu, Lu, Yingzhou, Zhang, Zaixi, Wan, Zhongwei, Ma, Yao, Zitnik, Marinka, Fu, Tianfan

Sommario: “...Currently, the field of structure-based drug design is dominated by three main types of algorithms...”
Testo

Asynchronous MIMO-OFDM Massive Unsourced Random Access with Codeword Collisions di Li, Tianya, Wu, Yongpeng, Gao, Junyuan, Zhang, Wenjun, Xia, Xiang-Gen, Ng, Derrick Wing Kwan, Xiao, Chengshan

Sommario: “...-negligible codeword collisions. The proposed coding framework segregates the data into two components, namely...”
Testo

Malicious Code Detection in Smart Contracts via Opcode Vectorization di Zou, Huanhuan, Li, Zongwei, Li, Xiaoqi

Sommario: “... frequently, and the existence of malicious codes may lead to the loss of user assets and system crash...”
Testo

Fast and accurate calculation of the bootstrap current and radial neoclassical transport in low collisionality stellarator plasmas di López, Francisco Javier Escoto

Sommario: “... equation at low collisionality is presented. The algorithm is based on the analytical properties...”
Testo