Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"looping suffix trees"”.

  1. Generic Reinforcement Learning Beyond Small MDPs

    … The current state-of-the-art in FRL uses suffix trees which have issues with large observation spaces and long-term dependencies. We start by addressing the issue of long-term dependency using a class of maps known as looping suffix trees, which have previously been used to represent …

    aus-cath Repository record for Generic Reinforcement Learning Beyond Small MDPs (opens in a new tab)

  2. Generic Reinforcement Learning Beyond Small MDPs

    … The current state-of-the-art in FRL uses suffix trees which have issues with large observation spaces and long-term dependencies. We start by addressing the issue of long-term dependency using a class of maps known as looping suffix trees, which have previously been used to represent …

    anu Repository record for Generic Reinforcement Learning Beyond Small MDPs (opens in a new tab)