ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1607.06641
  4. Cited By
Optimal resampling for the noisy OneMax problem
v1v2v3 (latest)

Optimal resampling for the noisy OneMax problem

22 July 2016
Jialin Liu
Michael Fairbank
Diego Pérez-Liébana
Simon Lucas
ArXiv (abs)PDFHTML

Papers citing "Optimal resampling for the noisy OneMax problem"

2 / 2 papers shown
Title
Bandit-Based Random Mutation Hill-Climbing
Bandit-Based Random Mutation Hill-Climbing
Jialin Liu
Diego Peŕez-Liebana
Simon Lucas
47
19
0
20 Jun 2016
OneMax in Black-Box Models with Several Restrictions
OneMax in Black-Box Models with Several Restrictions
Carola Doerr
Johannes Lengler
49
22
0
10 Apr 2015
1