Repositorio de Universidad Autónoma de Chile.
metadata only
Evaluating the efficient of using choice functions to solve CSPs via Autonomous Search [Evaluando La Eficiencia De Utilizar Funciones De Selección En Búsqueda Autónoma Para Resolver Problemas De Satisfacción De Restricciones]
Constraint programming is a powerful paradigm that allows for solving optimization and constraint satisfaction problems (CSPs). In this context, a main concern of this technology is that the efficient problem resolution usually relies on the employed solving strategy. Unfortunately, selecting the pr
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 impact of using different choice functions when solving CSPs with autonomous search#935621
- An extensible autonomous search framework for constraint programming#947555
- ProRetrieval: Learning to Orchestrate Hybrid Search via Executable Program Synthesis#780767
- ProRetrieval: Learning to Orchestrate Hybrid Search via Executable Program Synthesis#779392
- Optimization and Beyond#108435
Record · ID 948006
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