Browsing M.Sc. Computer Science by Title
Now showing items 7188 of 88

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 ... 
A RelationAlgebraic Approach to L  Fuzzy Topology
Any science deals with the study of certain models of the real world. However, a model is always an abstraction resulting in some uncertainty, which must be considered. The theory of fuzzy sets is one way of formalizing ... 
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 ... 
Statistical Image Analysis for Image Evolution
This thesis is focused on using genetic programming to evolve images based on lightweight features extracted from a given target image. The main motivation of this thesis is research by Lombardi et al. in which an image ... 
A Study of Ordered Gene Problems Featuring DNA Error Correction and DNA Fragment Assembly with a Variety of Heuristics, Genetic Algorithm Variations, and Dynamic Representations
(Brock University, 20140818)Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is ... 
Surface Areas of Some Interconnection Networks
An interesting property of an interconnected network (G) is the number of nodes at distance i from an arbitrary processor (u), namely the node centered surface area. This is an important property of a network due to its ... 
Swarmbased Algorithms for Neural Network Training
The main focus of this thesis is to compare the ability of various swarm intelligence algorithms when applied to the training of artificial neural networks. In order to compare the performance of the selected swarm ... 
A System for Models of First Order Theories
(20121012)If you want to know whether a property is true or not in a specific algebraic structure,you need to test that property on the given structure. This can be done by hand, which can be cumbersome and erroneous. In addition, ... 
Towards automated derivation in the theory of allegories
(Brock University, 20080216)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 Age Layered Population Structure for the MultiDepot Vehicle Routing Problem
This thesis studies the NPhard multidepot vehicle routing problem (MDVRP) which is an extension of the classical VRP with the exception that vehicles based at one of several depots should service every customer assigned ... 
Using Deep Learning for Predicting Stock Trends
Deep learning has shown great promise in solving complicated problems in recent years. One applicable area is finance. In this study, deep learning will be used to test the predictability of stock trends. Stock markets are ... 
Using genetic algorithms for the single allocation hub location problem
(Brock University, 20101025)Hub location problem is an NPhard 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 objectoriented programming language
(Brock University, 20090128)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 ...