Please use this identifier to cite or link to this item:
http://ir.mu.ac.ke:8080/jspui/handle/123456789/4289
Title: | Schemata bandits for MAXSAT |
Authors: | Ronoh, Nixon K. Milgo, Edna Kiprop, Ambrose K. Manderick, Bernard |
Keywords: | Random search Schemata bandits MAXSAT |
Issue Date: | Jan-2019 |
Publisher: | The ACM Digital Library |
Abstract: | In this paper, we propose the use of schemata bandits for optimization. This technique is a subclass of hierarchical bandits where the bandits are schemata. We investigate its use on a benchmark of binary combinatorial optimization problems, the Maximum Satisfiability (MAXSAT) problem. We compare performance with hierarchical Bayesian Opti- mization Algorithms (hBOAs) namely GSAT and WALK- SAT. Results suggest that using a bandit strategy enhances solver performance |
URI: | http://ir.mu.ac.ke:8080/jspui/handle/123456789/4289 |
Appears in Collections: | School of Biological & Physical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Ambrose K. Kiprop | 263.6 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.