Digital Repository

Browsing M.Sc. Computer Science by Title

DSpace/Manakin Repository

Browsing M.Sc. Computer Science by Title

Sort by: Order: Results:

  • Particle swarm optimization for two-connected networks with bounded rings 
    Foxwell, Earl Brendan. (Brock University, 2009-01-28)
    The Two-Connected Network with Bounded Ring (2CNBR) problem is a network design problem addressing the connection of servers to create a survivable network with limited redirections in the event of failures. Particle ...
  • Properties and algorithms of the (n, k)-arrangement graphs 
    Li, Yifeng (Brock University, 2010-03-09)
    The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is ...
  • Properties and algorithms of the (n, k)-star graphs 
    He, Liang. (Brock University, 2009-01-28)
    The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was ...
  • Properties and algorithms of the hyper-star graph and its related graphs 
    Zhang, Fan. (Brock University, 2010-03-09)
    The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some ...
  • Quadtree representation and compression of spatial data 
    Yin, Xiang (Brock University, 2010-03-09)
    Spatial data representation and compression has become a focus issue in computer graphics and image processing applications. Quadtrees, as one of hierarchical data structures, basing on the principle of recursive ...
  • ReAlM - a system to manipulate relations 
    Ahmed, Zafor (Brock University, 2010-10-26)
    Given a heterogeneous relation algebra R, it is well known that the algebra of matrices with coefficient from R is relation algebra with relational sums that is not necessarily finite. When a ...
  • Towards automated derivation in the theory of allegories 
    Glanfield, Joel. (Brock University, 2008-02-16)
    We provide an algorithm that automatically derives many provable theorems in the equational theory of allegories. This was accomplished by noticing properties of an existing decision algorithm that could be extended ...
  • Using genetic algorithms for the single allocation hub location problem 
    Naeem, Mohammad (Brock University, 2010-10-25)
    Hub location problem is an NP-hard problem that frequently arises in the design of transportation and distribution systems, postal delivery networks, and airline passenger flow. This work focuses on ...
  • Winâ Foy : functional object-oriented programming language 
    Foy, Grant. (Brock University, 2009-01-28)
    This thesis will introduce a new strongly typed programming language utilizing Self types, named Win--*Foy, along with a suitable user interface designed specifically to highlight language features. The need for such a ...

Search The Repository


Browse

My Account

Statistics


About the Digital Repository