20 results for “Knowledge of dispatching algorithms”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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.
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.
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.
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.
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.
A new polynomial-time algorithm is presented for optimally coloring perfect graphs using graph-theoretic operations and iterative walk counting.
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…
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…
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…
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…
The paper shows that finding a median under Ulam distance for four permutations is NP-hard, improving upon previous results.