Repositorio de Universidad Autónoma de Chile.
metadata only
Autonomous Search: Towards the Easy Tuning of Constraint Programming Solvers
Constraint programming (CP) allows users to solve combinatorial problems by simply launching the corresponding model in a search engine. However, achieving good results may clearly depend on the correct search engine configuration, which demands advanced knowledge from the modeler. Recently, Autonom
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
- An extensible autonomous search framework for constraint programming#947555
- Automaton#673819
- An intensification-driven search algorithm for the family traveling salesman problem with incompatibility constraints#231603
- AutomatiK#320185
- AutomatiK#320184
Record · ID 948553
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