arXiv (All)
open access
Optimizing Prompt Sequences using Monte Carlo Tree Search for LLM-Based Optimization
Mathematical optimization is a core tool in engineering, operations research, and data science, but modeling real problems remains difficult and time-consuming. In practice, an expert must work with clients to translate informal domain descriptions into precise objectives, constraints, and solver-re
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
- Property-Guided LLM Program Synthesis for Planning#192392
- A Parameter-Specific Retrieval and Knowledge-Guided Reasoning Framework for LLM-Based GPSR Optimization in FANETs#440326
- Compound Prompt Constraints in LLM Code Generation: A Factorial Study of Format, Persona, and Urgency#639746
- PK/PD-integrated Bayesian platform design for phase II dose regimen optimization#1078143
- Physics-Guided Bayesian Optimization for High-Dimensional Mixed-Variable MIMO Base Station Design#1160968
Record · ID 1389093
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