arXiv (All)
open access
Lawler-Moore Speedups via Additive Combinatorics
The Lawler-Moore dynamic programming framework is a classical tool in scheduling on parallel machines. It applies when the objective is regular, i.e. monotone in job completion times, and each machine follows a fixed priority order such as Smith's Rule or Jackson's Rule. For the basic objectives $Pm
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- FasterPy: An LLM-based Code Execution Efficiency Optimization Framework#1116186
- BCTuner: LLM-Guided Monte Carlo Tree Search for Efficient Blockchain Knob Tuning#229620
- TideRL: Boosting Agentic RL Goodput with Readiness-Aware Scheduling#444606
- Computational Simulation and Algorithm Analysis for Solving Combinatorial Optimization Problems in Graph Theory and Discrete Mathematics#246976
- Introduction to Algorithms (SMA 5503)#67271
Record · ID 985047
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive