Browsing M.Sc. Computer Science by Title
Now showing items 4665 of 72

Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming
(Brock University, 20140905)A complex network is an abstract representation of an intricate system of interrelated elements where the patterns of connection hold significant meaning. One particular complex network is a social network whereby the ... 
New Contig Creation Algorithm for the de novo DNA Assembly Problem
(Brock University, 20140225)DNA assembly is among the most fundamental and difficult problems in bioinformatics. Near optimal assembly solutions are available for bacterial and small genomes, however assembling large and complex genomes especially the ... 
Nonphotorealistic Rendering with Cartesian Genetic Programming using Graphic Processing Units
Nonphotorealistic rendering (NPR) is concerned with the algorithm generation of images having unrealistic characteristics, for example, oil paintings or watercolour. Using genetic programming to evolve aesthetically ... 
ObjectOriented Genetic Programming for the Automatic Inference of Graph Models for Complex Networks
Complex networks are systems of entities that are interconnected through meaningful relationships. The result of the relations between entities forms a structure that has a statistical complexity that is not formed by ... 
Particle swarm optimization for twoconnected networks with bounded rings
(Brock University, 20090128)The TwoConnected 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 ... 
Passive Solar Building Design Using Genetic Programming
(Brock University, 20131028)Passive solar building design is the process of designing a building while considering sunlight exposure for receiving heat in winter and rejecting heat in summer. The main goal of a passive solar building design is to ... 
Properties and algorithms of the (n, k)arrangement graphs
(Brock University, 20100309)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 nstar, the (n, k )arrangement graph is ... 
Properties and algorithms of the (n, k)star graphs
(Brock University, 20090128)The (n, k)star interconnection network was proposed in 1995 as an attractive alternative to the nstar topology in parallel computation. The (n, k )star has significant advantages over the nstar which itself was ... 
Properties and Algorithms of the (n,k)Arrangement Graphs and Augmented Cubes
The (n, k)arrangement graph was first introduced in 1992 as a generalization of the star graph topology. Choosing an arrangement topology is more efficient in comparison with a star graph as we can have a closer number ... 
Properties and algorithms of the hyperstar graph and its related graphs
(Brock University, 20100309)The hyperstar 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 ... 
Properties and Algorithms of the KCube Graphs
(Brock University, 20140324)The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at tractive Kautz digraph and well known hypercube graph, the KCube ... 
Properties and Algorithms of the KCube Interconnection Networks
The KCube interconnection network was first introduced in 2010 in order to exploit the good characteristics of two wellknown interconnection networks, the hypercube and the Kautz graph. KCube links up multiple processors ... 
Quadtree representation and compression of spatial data
(Brock University, 20100309)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 ... 
RealTime Automatic Object Classification and Tracking using Genetic Programming and NVIDIA R CUDA TM
(Brock University, 20140801)Genetic Programming (GP) is a widely used methodology for solving various computational problems. GP's problem solving ability is usually hindered by its long execution times. In this thesis, GP is applied toward realtime ... 
ReAlM  a system to manipulate relations
(Brock University, 20101026)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 ... 
Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems
(Brock University, 20131105)Qualitative spatial reasoning (QSR) is an important field of AI that deals with qualitative aspects of spatial entities. Regions and their relationships are described in qualitative terms instead of numerical values. This ... 
RelMDDA Library for Manipulating Relations Based on MDDs
(Brock University, 20120918)Relation algebras is one of the stateoftheart means used by mathematicians and computer scientists for solving very complex problems. As a result, a computer algebra system for relation algebras called RelView has ... 
The Salmon Algorithm  A New Population Based Search Metaheuristic
(Brock University, 20120302)This thesis introduces the Salmon Algorithm, a search metaheuristic which can be used for a variety of combinatorial optimization problems. This algorithm is loosely based on the path finding behaviour of salmon swimming ... 
A Scalability Study and New Algorithms for LargeScale ManyObjective Optimization
Many realworld optimization problems contain multiple (often conflicting) goals to be optimized concurrently, commonly referred to as multiobjective problems (MOPs). Over the past few decades, a plethora of multiobjective ... 
Shortest Path Routing on the Hypercube with Faulty Nodes
Interconnection networks are widely used in parallel computers. There are many topologies for interconnection networks and the hypercube is one of the most popular networks. There are a variety of different routing paradigms ...