Laurens Bliek

Orcid: 0000-0002-3853-4708

Affiliations:
  • Eindhoven University of Technology, The Netherlands


According to our database1, Laurens Bliek authored at least 21 papers between 2013 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
Benchmarking surrogate-based optimisation algorithms on expensive black-box functions.
Appl. Soft Comput., November, 2023

The first AI4TSP competition: Learning to solve stochastic routing problems.
Artif. Intell., June, 2023

Revisit the Algorithm Selection Problem for TSP with Spatial Information Enhanced Graph Neural Networks.
CoRR, 2023

Digital Twin Applications in Urban Logistics: An Overview.
CoRR, 2023

2022
Baseband-Function Placement With Multi-Task Traffic Prediction for 5G Radio Access Networks.
IEEE Trans. Netw. Serv. Manag., December, 2022

Learning Adaptive Evolutionary Computation for Solving Multi-Objective Optimization Problems.
CoRR, 2022

Machine Learning for Combinatorial Optimisation of Partially-Specified Problems: Regret Minimisation as a Unifying Lens.
CoRR, 2022

The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems.
CoRR, 2022

2021
EXPObench: Benchmarking Surrogate-based Optimisation Algorithms on Expensive Black-box Functions.
CoRR, 2021

Black-box combinatorial optimization using models with integer-valued minima.
Ann. Math. Artif. Intell., 2021

The EURO Meets NeurIPS 2022 Vehicle Routing Competition.
Proceedings of the NeurIPS 2022 Competition Track, 2021

Black-box mixed-variable optimisation using a surrogate model that satisfies integer constraints.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

Hospital simulation model optimisation with a random ReLU expansion surrogate model.
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021

2020
Black-box Mixed-Variable Optimisation using a Surrogate Model that Satisfies Integer Constraints.
CoRR, 2020

The Robust Malware Detection Challenge and Greedy Random Accelerated Multi-Bit Search.
Proceedings of the AISec@CCS 2020: Proceedings of the 13th ACM Workshop on Artificial Intelligence and Security, 2020

Continuous Surrogate-Based Optimization Algorithms Are Well-Suited for Expensive Discrete Problems.
Proceedings of the Artificial Intelligence and Machine Learning - 32nd Benelux Conference, 2020

2019
Automatic tuning of photonic beamformers: A data-driven approach.
PhD thesis, 2019

2018
Online Optimization With Costly and Noisy Measurements Using Random Fourier Expansions.
IEEE Trans. Neural Networks Learn. Syst., 2018

2017
Online function minimization with convex random relu expansions.
Proceedings of the 27th IEEE International Workshop on Machine Learning for Signal Processing, 2017

2013
Exploration and Exploitation in Visuomotor Prediction of Autonomous Agents.
CoRR, 2013

Universal Approximation Using Randomly Local Linear Models.
CoRR, 2013


  Loading...