Schemata bandits for MAXSAT

Please use this identifier to cite or link to this item: http://ir.mu.ac.ke:8080/jspui/handle/123456789/4289

Full metadata record

DC Field	Value	Language
dc.contributor.author	Ronoh, Nixon K.	-
dc.contributor.author	Milgo, Edna	-
dc.contributor.author	Kiprop, Ambrose K.	-
dc.contributor.author	Manderick, Bernard	-
dc.date.accessioned	2021-03-11T06:26:03Z	-
dc.date.available	2021-03-11T06:26:03Z	-
dc.date.issued	2019-01	-
dc.identifier.uri	http://ir.mu.ac.ke:8080/jspui/handle/123456789/4289	-
dc.description.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	en_US
dc.language.iso	en	en_US
dc.publisher	The ACM Digital Library	en_US
dc.subject	Random search	en_US
dc.subject	Schemata bandits	en_US
dc.subject	MAXSAT	en_US
dc.title	Schemata bandits for MAXSAT	en_US
dc.type	Article	en_US
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