arXiv (All)
open access
Digging for Decision Trees: A Case Study in Strategy Sampling and Learning
We introduce a formal model of transportation in an open-pit mine for the purpose of optimising the mine's operations. The model is a network of Markov automata (MA); the optimisation goal corresponds to maximising a time-bounded expected reward property. Today's model checking algorithms exacerbate
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
- Finite-Time Guarantees for Constrained Reinforcement Learning under Partial Observability#1356884
- Cost-Optimal Decision Diagrams for Stochastic Boolean Function Evaluation#303264
- An Empirical Analysis of the B-Tree Navigator Algorithm: Solving the Subset Sum Problem in Polynomial-Average Time#28917
- An Empirical Analysis of the B-Tree Navigator Algorithm: Solving the Subset Sum Problem in Polynomial-Average Time#28916
- Task-structured probabilistic I/O automata#357739
Record · ID 1459179
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