arXiv (All)
open access
Adaptive Utility Optimization for Stochastic Renewal Systems
This paper treats a system that performs back-to-back tasks. Each new task has a random matrix of parameters and can be processed in various processing modes. The processing mode determines the task duration and a vector of rewards (penalties are viewed as negative rewards). The reward vector can in
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
- The Development of a Self-Service Book Renewal System Using a Web-Based Application for the Creativity and Learning Room, College of Arts, Media and Technology, Chiang Mai University#26395
- Reliable Memory from Unstable Growth: Curating Self-Written Agent Playbooks with Randomized Experiments#1343937
- Safe and adaptive control of non-stationary stochastic systems via Lyapunov-constrained distributional reinforcement learning.#479279
- MARS: Multipath Adaptive Reliable Service#432483
- Model-Free Output Feedback Stabilization via Policy Gradient Methods#1128550
Record · ID 1324898
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