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

Fast Atomicity Monitoring di Tun, Hünkar Can, Dong, Yifan, Pavlogiannis, Andreas

Sommario: “... be understood by considering specific code blocks executing atomically. However, atomicity invariants are tricky...”
Testo

Portable PGAS ‐Based GPU ‐Accelerated Branch‐And‐Bound Algorithms at Scale di Guillaume Helbecque, Ezhilmathi Krishnasamy, Tiago Carneiro, Nouredine Melab, Pascal Bouvry

Sommario: “... problems demonstrated both code performance and code portability of the proposed algorithm on several GPU...”
Testo

Incentive-Aware Recommender Systems in Two-Sided Markets di Dai, Xiaowu, Xu, Wenlu, Qi, Yuan, Jordan, Michael I.

Sommario: “... algorithms satisfy an ex-post fairness criterion, which protects agents from over-exploitation. All code...”
Testo

FRENETIX: A High-Performance and Modular Motion Planning Framework for Autonomous Driving di Trauth, Rainer, Moller, Korbinian, Wuersching, Gerald, Betz, Johannes

Sommario: “... sampling-based trajectory planning algorithm. This approach effectively tackles the challenges of solution...”
Testo

KetGPT - Dataset Augmentation of Quantum Circuits using Transformers di Apak, Boran, Bandic, Medina, Sarkar, Aritra, Feld, Sebastian

Sommario: “...-written algorithm-based code (e.g., order of gates and qubits). Our three-fold verification process...”
Testo

DTR-Bench: An in silico Environment and Benchmark Platform for Reinforcement Learning Based Dynamic Treatment Regime di Luo, Zhiyao, Zhu, Mingcheng, Liu, Fenglin, Li, Jiali, Pan, Yangchen, Zhou, Jiandong, Zhu, Tingting

Sommario: “... algorithms within these contexts. To address this gap, we introduce \textit{DTR-Bench}, a benchmarking...”
Testo

TSI-Bench: Benchmarking Time Series Imputation di Du, Wenjie, Wang, Jun, Qian, Linglong, Yang, Yiyuan, Ibrahim, Zina, Liu, Fanxing, Wang, Zepu, Liu, Haoxin, Zhao, Zhiyuan, Zhou, Yingjie, Wang, Wenjia, Ding, Kaize, Liang, Yuxuan, Prakash, B. Aditya, Wen, Qingsong

Sommario: “... the development of numerous deep learning algorithms for time series imputation, the community lacks standardized...”
Testo

A faster multipole Legendre-Chebyshev transform di Mortensen, Mikael

Sommario: “...This paper describes a fast algorithm for transforming Legendre coefficients into Chebyshev...”
Testo

Parallel Contraction Hierarchies Can Be Efficient and Scalable di Wan, Zijin, Dong, Xiaojun, Wang, Letong, Zhu, Enzuo, Gu, Yan, Sun, Yihan

Sommario: “...Contraction Hierarchies (CH) (Geisberger et al., 2008) is one of the most widely used algorithms...”
Testo

Fast and Near-Optimal Collision-Free Robot Scheduling On Paths di Adamson, Duncan, Flaherty, Nathan, Potapov, Igor, Spirakis, Paul G., Zamaraeva, Elena

Sommario: “... algorithm (PA) introduced in arXiv:2402.12019 and present three baselines for comparison: an integer...”
Testo

Accelerating Machine Learning Systems via Category Theory: Applications to Spherical Attention for Gene Regulatory Networks di Abbott, Vincent, Kamiya, Kotaro, Glowacki, Gerard, Atsumi, Yu, Zardini, Gioele, Maruyama, Yoshihiro

Sommario: “... automated compilation methods are poor, and efficient algorithms require years of human development...”
Testo

The Right to be Forgotten in Pruning: Unveil Machine Unlearning on Sparse Models di Xiao, Yang, Li, Gen, Ji, Jie, Ye, Ruimeng, Ma, Xiaolong, Hui, Bo

Sommario: “... and unlearning algorithms. Our code is released at https://github.com/NKUShaw/SparseModels . ...”
Testo

Prompting Lipschitz-constrained network for multiple-in-one sparse-view CT reconstruction di Shi, Baoshun, Jiang, Ke, Lian, Qiusheng, Yu, Xinran, Fu, Huazhu

Sommario: “... analyzing the convergence of the proposed iterative algorithms. The data and code are publicly available...”
Testo

Square-root Time Atom Reconfiguration Plan for Lattice-shaped Mobile Tweezers di Aoyama, Koki, Tomita, Takafumi, Ino, Fumihiko

Sommario: “...This paper proposes a scalable planning algorithm for creating defect-free atom arrays in neutral...”
Testo

Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors di Kao, Ming-Yang, Wang, Jie

Sommario: “... approximation algorithm that has a provably small error for arbitrary $X$. Our algorithm incurs a worst-case...”
Testo

Soft-Output Successive Cancellation List Decoding di Yuan, Peihong, Duffy, Ken R., Médard, Muriel

Sommario: “...We introduce an algorithm for approximating the codebook probability that is compatible with all...”
Testo

Gender Bias in YouTube Exposure: Allocative and Structural Inequalities in Political Information Environments di Tan, Jipeng, Zhang, Weifeng, Wu, Ye, Guo, Jialin, Min, Yong

Sommario: “...Recommendation algorithms have become the dominant mechanism for information distribution...”
Testo

Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels di Kunde, Vishnu Teja, Chamberland, Jean-Francois, Narayanan, Krishna R., Ebert, Jamison

Sommario: “... depends on the mean and variance of the bit lengths and on the coder's algorithmic latency. This paper...”
Testo

Traversing combinatorial 0/1-polytopes via optimization di Merino, Arturo, Mütze, Torsten

Sommario: “... method relies on a simple and versatile algorithm for computing a Hamilton path on the skeleton of any 0...”
Testo

Quantum Algorithms for State Preparation and Data Classification based on Stabilizer Codes di Jouzdani, Pejman, Hashim, H. Arslan, Mucciolo, Eduardo R.

Sommario: “... of encoding input information into entangled quantum states known as the code space. Furthermore, to classify...”
Testo