Skip navigation
Skip navigation

Dynamic algorithm selection using reinforcement learning

Armstrong, Warren; Christen, Peter; McCreath, Eric; Rendell, Alistair

Description

It is often the case that many algorithms exist to solve a single problem, each possessing different performance characteristics. The usual approach in this situation is to manually select the algorithm which has the best average performance. However, this strategy has drawbacks in cases where the optimal algorithm changes during an invocation of the program, in response to changes in the program's state and the computational environment. This paper presents a prototype tool that uses...[Show more]

CollectionsANU Research Publications
Date published: 2006
Type: Conference paper
URI: http://hdl.handle.net/1885/32347
Source: International Workshop on Integrating AI and Data Mining (AIDM 2006) Proceedings
DOI: 10.1109/AIDM.2006.4

Download

File Description SizeFormat Image
01_Armstrong_Dynamic_algorithm_selection_2006.pdf359.88 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator