Procedural knowledge and expertise in algorithm design are usually hidden in source code and reproduced for each new optimization problem. In this work, we deal with the important question of how to store and encode this expertise in a reusable way. This is done by so-called Generative Executable Algorithm Knowledge Gr...
Camilo Chacón Sartori, José H. García, Andrei Tomut et al.· Conference on Computer Scien...· 0 citations
Large language models (LLMs) are increasingly being employed as variation operators in metaheuristics, generating or modifying candidate solutions, heuristics, or programs inside iterative search loops. This shift reframes variation as a model call conditioned on different types of information. We introduce an operator...
Camilo Chacón Sartori, Guillem Rodríguez-Corominas, Christian Blum· 0 citations
This work introduces Generative Executable Algorithm Knowledge Graphs (GEAKG), a representation in which this knowledge is stored as a generative, executable, transferable graph: typed nodes hold validated operators, edges encode admissible compositions, and learned edge weights record effective sequences.
Camilo Chacón Sartori, Jos'e H. Garc'ia, Andrei Tomut et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.