ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “study time constraints”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.NEEmpiricalRecentJul 25, 2026

A genetic algorithm for student academic resource allocation

Ana F. Hernández, Andrej Franulic, Fernando Jiménez

This paper proposes a Genetic Algorithm with constraint repair mechanism for optimally allocating educational resources to high school mathematics students under study time constraints.

View →
cs.CRcs.CYRecentMay 19, 2026

Locked Out at 8,000 Miles: Why UK-China Partnership Students Are Suffering

Benjamin Kenwright

The paper argues that over-engineered university cybersecurity protocols, while necessary, create significant accessibility barriers that disproportionately harm remote international students, particu…

View →
cs.DSTheoreticalRecentJun 19, 2026

Online Stacking with a Few Load/Unload Points

Martin Olsen

A simple online algorithm is presented for the stacking problem to avoid shifts with a sufficient condition involving stacking area dimension, load/unload points, and maximum items.

View →
cs.IRcs.AIEmpiricalRecentJun 12, 2026

ChronoID: Infusing Explicit Temporal Signals into Semantic IDs for Generative Recommendation

Dongdong Nian, Dongqi Fu, Chenliang Xu, Yinglong Xia +3 more

This paper proposes ChronoID, a framework for time-aware semantic ID learning in generative recommendation.

View →
cs.DMcs.DSTheoreticalRecentJul 7, 2026

Sudoku Grids That Require Many Clues

David Eppstein, Xinyu, Zhang

This paper proves that a majority of filled-in Sudoku grids require a logarithmic fraction of cells to be filled by clues, and constructs grids requiring 18 and 80 clues for 9x9 and 16x16 Sudoku, resp…

View →
cs.CYcs.AIRecentMay 31, 2026

Beyond Access: Guided LLM Scaffolding for Independent Learning in Undergraduate Statistics

Mohammad Amanlou, Yasaman Amou-Jafari, Mehrad Livian, Fatemeh Boloukazari +2 more

This study compares different levels of LLM access in a statistics course, finding that structured, guided use significantly improves students' reasoning skills and independent learning compared to un…

View →
cs.CLcs.AIRecentMay 29, 2026

D$^3$: Dynamic Directional Graph-Constrained Data Scheduling for LLM Training

Yuanjian Xu, Jianing Hao, Guang Zhang, Zhong Li

The paper proposes $D^3$, a dynamic graph-constrained scheduling framework that optimizes LLM training order by modeling sample interactions as a dynamic influence graph.

View →
cs.CCcs.LGTheoreticalRecentJun 11, 2026

The Program Is Still There: A Conservation Law for Program Discovery

Jorge Miguel Silva

This paper measures the lower bound for the shortest program generating a sequence, proving a conservation law and providing a deterministic engine to recover generating programs for certain sequences…

View →
cs.DCEmpiricalRecentJul 2, 2026

Elasticity in Parallel Sparse Triangular Solve

Raphael S. Steiner, Christos K. Matzoros, Pál András Papp, Toni Böhnlein +1 more

This paper introduces Stale Synchronous Parallel mode of execution for parallel sparse triangular linear system solve and presents a scheduler that achieves geometric-mean speed-ups of 7-30% over Grow…

View →
cs.AIRecentJun 1, 2026

An NLP-Driven Framework for Curriculum-Labor Market Alignment: Schema-Constrained LLM Extraction, ESCO-Anchored Semantic Matching, and Multi-Dimensional Gap Quantification

Sherzod Turaev, Mary John, Mamoun Awad, Nazar Zaki +1 more

The paper introduces a robust four-stage NLP framework that uses schema-constrained LLMs and ESCO vocabulary to accurately extract and align educational competencies with labor market demands, quantif…

View →
cs.AIRecentMay 28, 2026

Harmonizing Real-Time Constraints and Long-Horizon Reasoning: An Asynchronous Agentic Framework for Dynamic Scheduling

Shijie Cao, Yuan Yuan, Jing Liu

RACE-Sched is an asynchronous agentic framework that successfully integrates low-latency, real-time scheduling decisions with advanced, long-horizon reasoning provided by Large Language Models.

View →
cs.AIRecentMay 31, 2026

Advanced Mathematics Learning Behavior Prediction and Academic Early Warning Model Based on Multimodal Data Analysis

Liu Qiong, Li Zhengbo

The paper proposes a multimodal data analytics framework combining knowledge graphs and temporal modeling to accurately predict advanced mathematics learning difficulties and provide early academic wa…

View →
cs.FLcs.CRRecentMar 27, 2026

Evolution-Based Timed Opacity under a Universal Observation Model

Zhe Zhang, Martijn Goorden, Michel Reniers

The paper establishes a unified framework for timed opacity by introducing a universal observation model and defining evolution-based timed opacity, proving its relationship to existing opacity defini…

View →
cs.CLRecentMay 31, 2026

Robust Asynchronous Planning via Auto-Formalization

Jiayi Zhang, Jianing Yin, Ben Zhou, Li Zhang

The paper introduces new benchmarks for complex asynchronous planning and demonstrates that general constraint satisfaction formalizers (like CP-SAT) significantly outperform direct LLM planning or tr…

View →
cs.DMTheoreticalRecentJul 3, 2026

Scheduling Tasks towards Energy Autarky: Benefits and Computational Costs of Flexibility

Robert Bredereck, Till Fluschnik, Klaus Heeger

This paper studies the autarky problem of scheduling energy-consuming jobs with time windows using a battery and an energy forecast, and shows NP-hardness, polynomial-time solvability, and fixed-param…

View →
cs.AIRecentMay 28, 2026

Temporal Stability and Few-Shot Prompting in Math Task Assessment

Danielle S. Fox, Brenda L. Robles, Elizabeth DiPietro Brovey, Christian D. Schunn

This study investigated the stability and prompt-responsiveness of AI tools in classifying the cognitive demand of math tasks, finding that few-shot prompting was a more reliable performance booster t…

View →
cs.PLcs.LGTheoreticalRecentJul 23, 2026

Relaxed activation analysis of dataflow networks - A clock calculus for machine learning and real-time scheduling

William Gaudelier, Albert Cohen, Dumitru Potop Butucaru

The paper proposes a conservative extension of Lustre's clock calculus to facilitate the embedding of ML models in reactive applications.

View →
cs.LGcs.AIRecentMay 27, 2026

On the Learnability of Test-Time Adaptation: A Recovery Complexity Perspective

Zhi Zhou, Ming Yang, Shi-Yu Tian, Kun-Yang Yu +2 more

The paper establishes the first theoretical framework for analyzing the learnability of Test-Time Adaptation (TTA) under non-stationary data streams by introducing Recovery Complexity, which quantifie…

View →