Institutional Repository

Browsing Department of Decision Sciences by Type "Thesis"

Browsing Department of Decision Sciences by Type "Thesis"

Sort by: Order: Results:

  • Sauer, Paul Van der Merwe (2019-12)
    The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. The word α over a finite set A is said to be unavoidable for an infinite set B+ of nonempty words over a finite ...
  • Bloy, Leslie Arthur Keith (2009-08-25)
    Braess' paradox is a counter-intuitive phenomenon which can occur in congesting networks. It refers to those cases where the introduction of a new link in the network results in the total travel time on the network ...
  • Mukeru, Safari (2010-09)
    After a review of the notions of Hausdorff and Fourier dimensions from fractal geometry and Fourier analysis and the properties of local times of Brownian motion, we study the Fourier structure of Brownian level sets. ...
  • Fick, Machteld (2013-06)
    Die doel van hierdie studie was om te bepaal tot watter mate ’n suiwer patroongebaseerde benadering tot woordafbreking bevredigende resultate lewer. Die masjienleertegnieke kunsmatige neurale netwerke, beslissingsbome en ...
  • Mpanda, Marc Mukendi (2022-08)
    In this thesis, we investigate the roughness feature within realised volatility for different financial markets by using the multifractal detrended fluctuation approach and microstructure noise index technique, and we ...
  • Engelbrecht, Gerhard Nieuwoudt (2003-06)
    Military Strategy is defined as a plan at the military strategic level of war that consists of a set of military strategic ends, ways and means and the relationships between them. This definition leads to the following ...
  • Adeyefa, Segun Adeyemi (2011-06)
    Multiobjective Stochastic Linear Programming is a relevant topic. As a matter of fact, many real life problems ranging from portfolio selection to water resource management may be cast into this framework. There are ...
  • Oberholzer, Christiaan Vermaak (2009-02)
    Satellite Scheduling Problems (SSP) are NP-hard and constraint programming and metaheuristics solution methods yield mixed results. This study investigates a new version of the SSP, the Satellite Constellation Time-Window ...

Search UnisaIR


Browse

My Account