Repositorio de Universidad Autónoma de Chile.
metadata only
The impact of using different choice functions when solving CSPs with autonomous search
Constraint programming is a powerful technology for the efficient solving of optimization and constraint satisfaction problems (CSPs). A main concern of this technology is that the efficient problem resolution usually relies on the employed solving strategy. Unfortunately, selecting the proper one i
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
- 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]#948006
- An extensible autonomous search framework for constraint programming#947555
- Optimization and Beyond#108435
- Family_Winner: Integrating Game Theory and Heuristics to Provide Negotiation Support#203240
- Problem representation for refinement#90032
Record · ID 935621
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