受强制性开放获取政策约束的文章 - Jakob Bossek了解详情
可在其他位置公开访问的文章：25 篇
A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
O Mersmann, B Bischl, H Trautmann, M Wagner, J Bossek, F Neumann
Annals of Mathematics and Artificial Intelligence 69, 151-182, 2013
强制性开放获取政策： German Research Foundation
Leveraging TSP solver complementarity through machine learning
P Kerschke, L Kotthoff, J Bossek, HH Hoos, H Trautmann
Evolutionary computation 26 (4), 597-620, 2018
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
Evolving diverse TSP instances by means of novel and creative mutation operators
J Bossek, P Kerschke, A Neumann, M Wagner, F Neumann, H Trautmann
Proceedings of the 15th ACM/SIGEVO conference on foundations of genetic …, 2019
强制性开放获取政策： Australian Research Council, European Commission
Local search and the traveling salesman problem: A feature-based characterization of problem hardness
O Mersmann, B Bischl, J Bossek, H Trautmann, M Wagner, F Neumann
Learning and Intelligent Optimization: 6th International Conference, LION 6 …, 2012
强制性开放获取政策： German Research Foundation
Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions
A Neumann, J Bossek, F Neumann
Proceedings of the Genetic and Evolutionary Computation Conference, 261-269, 2021
强制性开放获取政策： Australian Research Council
Evolving diverse sets of tours for the travelling salesperson problem
AV Do, J Bossek, A Neumann, F Neumann
Proceedings of the 2020 Genetic and Evolutionary Computation Conference, 681-689, 2020
强制性开放获取政策： Australian Research Council
Evolutionary diversity optimization and the minimum spanning tree problem
J Bossek, F Neumann
Proceedings of the Genetic and Evolutionary Computation Conference, 198-206, 2021
强制性开放获取政策： Australian Research Council
Entropy-based evolutionary diversity optimisation for the traveling salesperson problem
A Nikfarjam, J Bossek, A Neumann, F Neumann
Proceedings of the Genetic and Evolutionary Computation Conference, 600-608, 2021
强制性开放获取政策： Australian Research Council
Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation
A Nikfarjam, J Bossek, A Neumann, F Neumann
Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic …, 2021
强制性开放获取政策： Australian Research Council
Runtime analysis of randomized search heuristics for dynamic graph coloring
J Bossek, F Neumann, P Peng, D Sudholt
Proceedings of the Genetic and Evolutionary Computation Conference, 1443-1451, 2019
强制性开放获取政策： Australian Research Council
Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms
J Bossek, A Neumann, F Neumann
Proceedings of the Genetic and Evolutionary Computation Conference, 556-564, 2021
强制性开放获取政策： Australian Research Council
Exploring the feature space of TSP instances using quality diversity
J Bossek, F Neumann
Proceedings of the Genetic and Evolutionary Computation Conference, 186-194, 2022
强制性开放获取政策： Australian Research Council
Evolving sampling strategies for one-shot optimization tasks
J Bossek, C Doerr, P Kerschke, A Neumann, F Neumann
Parallel Problem Solving from Nature–PPSN XVI: 16th International Conference …, 2020
强制性开放获取政策： Australian Research Council
The node weight dependent traveling salesperson problem: Approximation algorithms and randomized search heuristics
J Bossek, K Casel, P Kerschke, F Neumann
Proceedings of the 2020 Genetic and Evolutionary Computation Conference …, 2020
强制性开放获取政策： Federal Ministry of Education and Research, Germany
Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem
V Roostapour, J Bossek, F Neumann
Proceedings of the 2020 Genetic and Evolutionary Computation Conference, 551-559, 2020
强制性开放获取政策： Australian Research Council
On the benefits of biased edge-exchange mutation for the multi-criteria spanning tree problem
J Bossek, C Grimme, F Neumann
Proceedings of the Genetic and Evolutionary Computation Conference, 516-523, 2019
强制性开放获取政策： Australian Research Council
Generating instances with performance differences for more than just two algorithms
J Bossek, M Wagner
Proceedings of the Genetic and Evolutionary Computation Conference Companion …, 2021
强制性开放获取政策： Australian Research Council
Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
J Bossek, F Neumann, P Peng, D Sudholt
Algorithmica 83 (10), 3148-3179, 2021
强制性开放获取政策： Australian Research Council
Process-oriented stream classification pipeline: A literature review
L Clever, JS Pohl, J Bossek, P Kerschke, H Trautmann
Applied Sciences 12 (18), 9094, 2022
强制性开放获取政策： Federal Ministry of Education and Research, Germany
Time complexity analysis of RLS and (1+ 1) EA for the edge coloring problem
J Bossek, D Sudholt
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic …, 2019
强制性开放获取政策： European Commission
出版信息和资助信息由计算机程序自动确定