Expertini Research Research

Browse Research Papers

291,239+ open-access research outputs.

โœ• Clear
๐Ÿ” computer simulation ๐Ÿ“‚ Computer Science
Showing 291239 results for "computer simulation" in Computer Science
Computer Science Preprint PDF DOI

A 3GPP Perspective on Spectrum Sharing for the 5G-to-6G Migration: From DSS to MRSS

Xingqin Lin ยท 2026

Dynamic spectrum sharing (DSS) played an important role in the 4G-to-5G transition by allowing 5G new radio (NR) to enter valuable legacy spectrum without immediate static refarming. Yet practical depโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Resume-ing Control: (Mis)Perceptions of Agency Around GenAI Use in Recruiting Workflows

Sajel Surati, Rosanna Bellini, Emily Black ยท 2026

When generative AI (genAI) systems are used in high-stakes decision-making, its recommended role is to aid, rather than replace, human decision-making. However, there is little empirical exploration oโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Joint Transceiver Orientation Optimization for Rotatable-Antenna MIMO Capacity Maximization

Zheng Ailing, Wu Qingqing, Peng Xingxiang, Peng Qiaoyan, Zheng Ziyuan, Chen Wen ยท 2026

Conventional multiple-input multiple-output (MIMO) systems mainly rely on fixed antenna arrays, which limits their capability to adapt the effective channel matrix to the propagation environment. Rotaโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Solving Positive Linear Programs with Differential Privacy

Alina Ene, Huy Le Nguyen, Ta Duy Nguyen, Adrian Vladu ยท 2026

We study differentially private approximation algorithms for positive linear programs (LPs with nonnegative coefficients and variables), focusing on the fundamental families of packing, covering, and โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs

Liam Roditty, Ariel Sapir ยท 2026

We introduce a generalized family of $\left( 2\cdot \left\lfloor \frac{k}{2} \right\rfloor-1, 2\cdot \left\lceil \frac{k}{2} \right\rceil \cdot W_{1} +\max\left\{0,2\cdot\left(\left\lceil\frac{k}{2}\rโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Full Definability in a Profunctorial Model

Takeshi Tsukada, Kazuyuki Asada, Kengo Hirata ยท 2026

A semantic model enjoys full definability if every semantic element in the model is a denotation of some proof or program. Full definability indicates that the model captures programs and proofs in a โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A Test Taxonomy and Continuous Integration Ecosystem for Dynamic Resource Management in HPC

Petter Sand{aa}s, Inigo Arejula-Aisa, Sergio Iserte, Antonio J. Pena ยท 2026

High-performance computing (HPC) systems are increasingly exploring dynamic resource management and malleable MPI applications to better adapt to heterogeneous architectures, fluctuating workloads, anโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Exploring the Efficiency of 3D-Stacked AI Chip Architecture for LLM Inference with Voxel

Yiqi Liu, Noelle Crawford, Michael Wang, Jilong Xue, Jian Huang ยท 2026

To overcome the well-known memory bottleneck of AI chips, 3D stacked architectures that employ advanced packaging technology with high-density through-silicon vias (TSVs) pins have proven to be a promโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

What Is the Cost of Energy Monitoring? An Empirical Study on the Overhead of RAPL-Based Tools

Jeremy Diamond, Vincenzo Stoico ยท 2026

The Running Average Power Limit (RAPL) interface is widely used to estimate software energy consumption via CPU and DRAM counters, but tool design differences and high-frequency polling can introduce โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A proof of Jordan curve theorem based on the sweepline algorithm for trapezoidal decomposition of a polygon

Apurva Mudgal ยท 2026

We prove the Jordan curve theorem by generalizing the sweepline algorithm for trapezoidal decomposition of a polygon. Our proof uses Zorn's lemma (or, equivalently the axiom of choice). Though severalโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

MISES: Minimal Information Sufficiency for Effective Service

Joss Armstrong ยท 2026

Category-based coordination mechanisms allocate resources by mapping a declared service category to a fixed resource profile, without observing individual demand types. We establish three results for โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A Semantic Quantum Circuit Cache for Scalable and Distributed Quantum-Classical Workflows

Mar Tejedor, Javier Conejero, Rosa M. Badia ยท 2026

Hybrid quantum--classical workflows often execute large ensembles of circuits that differ syntactically but implement identical operations, leading to substantial redundant computation. To address thiโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Input Distribution Design for Ranging-Oriented OFDM-ISAC Systems Under Frequency-Selective Fading

Weijiang Zhao, Yifeng Xiong ยท 2026

The implementation of the \ac{isac} feature in \ac{6g} networks is most likely to be based on the framework of \ac{ofdm}. Input distribution design, or constellation design, is a crucial technique in โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

LLM-Guided Runtime Parameter Optimization for Energy-Efficient Model Inference

Katelyn Crumpacker, Dimitrios Nikolopoulos ยท 2026

Large Language Models (LLMs) have become an integral part of many real-world workflows. However, LLMs consume a lot of energy, which becomes a large concern in the scale of the demand for these tools.โ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Factorized Latent Reasoning for LLM-based Recommendation

Tianqi Gao, Chengkai Huang, Zihan Wang, Cao Liu, Ke Zeng, Lina Yao ยท 2026

Large language models (LLMs) have recently been adopted for recommendation by framing user preference modeling as a language generation problem. However, existing latent reasoning approaches typicallyโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Locality for Codes over the Integers

Giulia Cavicchioni, Eleonora Guerrini, Julien Lavauzelle ยท 2026

In this work, we study the codes over the integers with locality constraints. We introduce a weighted notion of locality over $\mathbb{Z}/q_1\mathbb{Z} \times \cdots \times \mathbb{Z}/q_n\mathbb{Z}$ aโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

Runtime Verification: Monitoring, Knowledge, and Uncertainty (Lecture Notes)

Benedikt Bollig ยท 2026

Runtime verification is a lightweight verification technique that complements model checking by analyzing system executions at runtime rather than exploring a complete system model in advance. It is pโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem

Lucas Meijer, Till Miltzow, Johanna Ockenfels, Milos Stojakovic ยท 2026

In the (Nesting) Bird Box Problem we are given a polygonal domain P and a number k and we want to know if there is a set B of k points inside P such that no two points in B can see each other. The undโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

On the Complexity of Robust Markov Decision Processes and Bisimulation Metrics

Marnix Suilen, Guillermo A. Perez ยท 2026

Robust Markov decision processes (RMDPs) extend standard Markov decision processes (MDPs) to account for uncertainty in the transition probabilities. RMDPs have an uncertainty set that defines a set oโ€ฆ

Read Paper โ†’
Computer Science Preprint PDF DOI

A Sufficient-Statistic Reduction of the Information Bottleneck to a Low-Dimensional Problem

Joss Armstrong ยท 2026

We show that if the conditional distribution p(C | T) factors through a sufficient statistic {\phi}(T), then the Information Bottleneck (IB) problem for (T, C) is exactly equivalent to the IB problem โ€ฆ

Read Paper โ†’
โ† Prev Page 11 of 14562 Next โ†’