arXiv (All)
open access
Dynamic programming principle in cost-efficient sequential design: optimal update scheduling under cost constraints
We study sequential cost-efficient design in a situation where each update of covariates involves a fixed time cost typically considerable compared to a single measurement time. The problem arises from parameter estimation in switching measurements on superconducting Josephson junctions which are co
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
- Learning parameter curves in feedback-based quantum optimization algorithms#1144750
- Real-time black-box optimization for dynamic discrete environments using embedded Ising machines.#659613
- Sub-spin-flop switching of a fully compensated antiferromagnet by magnetic field#1070705
- Time-Series Forecasting in Smart Manufacturing Systems: An Experimental Evaluation of the State-of-the-Art Algorithms#372557
- The $A$-optimal design problem and the $S$-matrix conjecture#1034074
Record · ID 997907
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