Runtime analysis of (1 + 1) evolutionary algorithm controlled with Q-learning using greedy exploration strategy on OneMAX+ZEROMAX problem

Denis Antipov, Maxim Buzdalov, Benjamin Doerr

Research output: Chapter in Book/Report/Conference proceeding › Conference Proceeding (Non-Journal item)

1 Citation (Scopus)

Fingerprint

Dive into the research topics of 'Runtime analysis of (1 + 1) evolutionary algorithm controlled with Q-learning using greedy exploration strategy on OneMAX+ZEROMAX problem'. Together they form a unique fingerprint.

Computer Science