Predicting knowledge in an ontology stream
Freddy Lécué, Jeff Z. Pan
IJCAI 2013
For hard optimization problems, it is difficult to design heuristic algorithms which exhibit uniformly superior performance for all problem instances. As a result it becomes necessary to tailor the algorithms based on the problem instance. In this paper, we introduce the use of a cooperative problem solving team of heuristics that evolves algorithms for a given problem instance. The efficacy of this method is examined by solving six difficult instances of a bicriteria sparse multiple knapsack problem. Results indicate that such tailored algorithms uniformly improve solutions as compared to using predesigned heuristic algorithms.
Freddy Lécué, Jeff Z. Pan
IJCAI 2013
Hagen Soltau, Lidia Mangu, et al.
ASRU 2011
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
R. Sebastian, M. Weise, et al.
ECPPM 2022