arXiv AI
Trajectory-Initialized Neural Double Q-Routing for Large-Scale Overhead Hoist Transport Systems
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Machine Learning
Jul 27
TRACE-ROUTER: Task-Consistent and Adaptive Online Routing for Agentic AI
arXiv:2607. 22465v1 Announce Type: cross Abstract: Routing to select large language models (LLMs) with different cost-quality trade-offs has become a fundamental deployment feature of enterprise AI.
arXiv Machine Learning
Sep 10
Towards Near-Real-Time Telemetry-Aware Routing with Neural Routing Algorithms
arXiv:2604.02927v3 Announce Type: replace Abstract: Routing algorithms are crucial for efficient computer network operations, and in many settings they must be able to react to traffic bursts within...
arXiv Machine Learning
Sep 10
Routing Dense Layouts with History-Aware Offline Reinforcement Learning using LSTM
arXiv:2609.08232v1 Announce Type: cross Abstract: Detailed routing remains a dominant runtime bottleneck in physical design due to increasing complexity of design rules. Modern routers can struggle t...
arXiv Machine Learning
1d ago
AgentRouter: Heterogeneous Model Routing for Cost-Optimal Multi-Step Agentic Workflows
arXiv:2609.22951v1 Announce Type: cross Abstract: Enterprise agentic systems that route every trajectory step to a frontier model waste 60-80% of their inference budget on subtasks that smaller model...
Hugging Face Trending Papers
Sep 8
Routing Dense Layouts with History-Aware Offline Reinforcement Learning using LSTM
The paper introduces a history‑aware offline reinforcement learning policy that predicts iterative cost weights for routing in dense integrated circuit designs. By incorporating a lightweight LSTM and additional router features, the policy retains sequence context and improves convergence across various placement densities and guide qualities. Integrated into any cost‑based router with minimal changes, the approach reduces design rule violations by an average of 92% and cuts runtime by 10%.
arXiv Machine Learning
Aug 4
Learning Graph-Indexed Trajectory Patterns for Stochastic On-Time Arrival Routing
arXiv:2508. 17218v4 Announce Type: replace Abstract: Correlated link travel times create decision-relevant patterns in partial route histories.