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

20 results for “Knowledge of dispatching algorithms”

CS papers only

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

Want pure semantic search? Try claim verification →

cs.NIEmpiricalRecentJul 27, 2026

Methods for Path Set Attribute Calculation in Network Systems

Giovanni Fiaschi, Carlo Vitucci, Thomas Westerbäck, Daniel Sundmark +1 more

This paper presents an optimized algorithm for computing cut sets of a path set in graph theory and introduces a vectorized computational framework for property calculations.

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.DSTheoreticalRecentJul 17, 2026

Revisiting Real-Time Interval and Throughput Maximization

Allan Borodin, Changdao He, Nadim Mottu

The paper extends results for interval scheduling to the more general throughput problem in the real-time model with constant competitive ratios for specific weight functions and advance notice.

View →
math.OCcs.DSTheoreticalRecentOct 19, 2026

Solving Classes of Linear Programs with Strongly Polynomial Straight Line Complexity in Strongly Polynomial Time

Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver +1 more

This paper presents an initialization framework and rounding procedure for interior point methods in linear programming, ensuring strongly polynomial time complexity.

View →
cs.LOcs.PLEmpiricalRecentJun 26, 2026

KoAT: Automatic Complexity and Termination Analysis of Integer Programs

Nils Lommen, Éléanore Meyer, Jürgen Giesl

KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.

View →
cs.DScs.DMmath.COTheoreticalRecentJul 10, 2026

A Polynomial-Time Algorithm for Coloring Perfect Graphs Based on Walk Counting

Amir Ali Ahmadi, Pravesh K. Kothari, Yukai Tang

A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.

View →
cs.CCTheoreticalRecentJul 31, 2026

On the Complexity of Computing Outputs of a Metric Turing Machine

Yaroslav Ivanashev

This paper introduces classes of functions that compute the k-th solution for certain types of problems and proves their inter-reducibility with corresponding classes for different order functions. It…

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.DSTheoreticalRecentJul 3, 2026

Optimality-Preserving Data Reduction for Maximum k-Cut (Full Version)

Michael Kaibel, Petra Mutzel

This paper introduces structured cut sets, a novel preprocessing technique for Maximum k-Cut, and extends existing techniques from Maximum Cut. The rules are optimality-preserving and yield significan…

View →
cs.AIcs.LGRecentMay 27, 2026

Bridging the Sim-to-Real Gap in Reinforcement Learning-Based Industrial Dispatching through Execution Semantics

Jonathan Hoss, Noah Klarmann

The paper proposes a policy-neutral execution and measurement layer to mediate between reinforcement learning policies and industrial environments, transforming ambiguous execution failures into struc…

View →
cs.CCTheoreticalRecentAug 6, 2026

Ulam Median is NP-hard for Four Permutations

Mursalin Habib

The paper shows that finding a median under Ulam distance for four permutations is NP-hard, improving upon previous results.

View →