Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2304.13117
Cited By
When to be Discrete: Analyzing Algorithm Performance on Discretized Continuous Problems
25 April 2023
André Thomaser
Jacob De Nobel
Diederick Vermetten
Furong Ye
Thomas Bäck
Anna V. Kononova
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"When to be Discrete: Analyzing Algorithm Performance on Discretized Continuous Problems"
3 / 3 papers shown
Title
Log-normal Mutations and their Use in Detecting Surreptitious Fake Images
Ismail Labiad
Thomas Bäck
Pierre Fernandez
Laurent Najman
Tom Sander
Furong Ye
M. Zameshina
Olivier Teytaud
AAML
73
0
0
23 Sep 2024
cmaes : A Simple yet Practical Python Library for CMA-ES
Masahiro Nomura
Masashi Shibata
109
23
0
02 Feb 2024
Run Time Bounds for Integer-Valued OneMax Functions
Jonathan Gadea Harder
Timo Kotzing
Xiaoyue Li
Aishwarya Radhakrishnan
96
3
0
21 Jul 2023
1