• Parallel Monte-Carlo tree search in distributed environments 

      Christoph, Marc (Stellenbosch : Stellenbosch University., 2020-03)
      ENGLISH ABSTRACT: Parallelising Monte-Carlo Tree Search (MCTS) holds the promise of being an effective way to improve the effectiveness of the search, given some time constraint. Thus, finding scalable parallelisation ...
    • Two new combinatorial problems involving dominating sets for lottery schemes 

      Grundlingh, Werner R. (Stellenbosch : University of Stellenbosch, 2004-12)
      Suppose a lottery scheme consists of randomly selecting an unordered winning n-subset from a universal set of m numbers, while a player participates in the scheme by purchasing a playing set of any number of unordered ...