2 papers
cs.NE2026
Improved Runtime Bound for the EA on BinVal
Joris Belder, Johannes Lengler, Raghu Raman Ravi
We study the EA on the Binary Value function BinVal. We show that it needs at most function evaluations to find the optimum when $μ= o(n/\log…
cs.NI2026
Scrutinizing Real-life Configurations of Random Access Procedures in Cellular Networks
Joris Belder, Anup Bhattacharjee, Fernando Kuipers
In cellular networks, base stations broadcast configurations that devices use for the random access procedure, which is a vital part of the connection setup. Ideally, the network s…