Daan van den Berg

Orcid: 0000-0001-5060-3342

According to our database1, Daan van den Berg authored at least 23 papers between 2019 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Too Constrained for Genetic Algorithms too Hard for Evolutionary Computing the Traveling Tournament Problem.
Proceedings of the 15th International Joint Conference on Computational Intelligence, 2023

The Opaque Nature of Intelligence and the Pursuit of Explainable AI.
Proceedings of the 15th International Joint Conference on Computational Intelligence, 2023

The Partition Problem, and How The Distribution of Input Bits Affects the Solving Process.
Proceedings of the 15th International Joint Conference on Computational Intelligence, 2023

Can HP-protein Folding Be Solved with Genetic Algorithms? Maybe not.
Proceedings of the 15th International Joint Conference on Computational Intelligence, 2023

Randomness in Local Optima Network Sampling.
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

From Fitness Landscapes to Explainable AI and Back.
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023

Frequency Fitness Assignment on JSSP: A Critical Review.
Proceedings of the Applications of Evolutionary Computation - 26th European Conference, 2023

Quantifying Instance Hardness of Protein Folding within the HP-model.
Proceedings of the IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology, 2023

2022
The Hardest Hamiltonian Cycle Problem Instances: The Plateau of Yes and the Cliff of No.
SN Comput. Sci., 2022

Solving the Traveling Salesperson Problem using Frequency Fitness Assignment.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2022

Universally Hard Hamiltonian Cycle Problem Instances.
Proceedings of the 14th International Joint Conference on Computational Intelligence, 2022

Making Hard(Er) Bechmark Test Functions.
Proceedings of the 14th International Joint Conference on Computational Intelligence, 2022

Exactly characterizable parameter settings in a crossoverless evolutionary algorithm.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Survivor selection in a crossoverless evolutionary algorithm.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

Painting with Evolutionary Algorithms.
Proceedings of the Artificial Intelligence in Music, Sound, Art and Design, 2022

2021
Backtracking (the) Algorithms on the Hamiltonian Cycle Problem.
CoRR, 2021

Subset Sum and the Distribution of Information.
Proceedings of the 13th International Joint Conference on Computational Intelligence, 2021

2020
Looking for the Hardest Hamiltonian Cycle Problem Instances.
Proceedings of the 12th International Joint Conference on Computational Intelligence, 2020

Parameter Sensitivity Patterns in the Plant Propagation Algorithm.
Proceedings of the 12th International Joint Conference on Computational Intelligence, 2020

Monte carlo tree search on perfect rectangle packing problem instances.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

On the solvability of routing multiple point-to-point paths in manhattan meshes.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019
Fireworks Algorithm versus Plant Propagation Algorithm.
Proceedings of the 11th International Joint Conference on Computational Intelligence, 2019

Paintings, Polygons and Plant Propagation.
Proceedings of the Computational Intelligence in Music, Sound, Art and Design, 2019


  Loading...