Now showing items 59-78 of 88

  • Object Classification using L-Fuzzy Concept Analysis 

    Addison, George Tsekpetse
    Object classification and processing have become a coordinated piece of modern industrial manufacturing systems, generally utilized in a manual or computerized inspection process. Vagueness is a common issue related to ...
  • Object-Oriented Genetic Programming for the Automatic Inference of Graph Models for Complex Networks 

    Medland, Michael; Medland, Michael
    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 ...
  • Objective reduction in many-objective optimization problems 

    Sen Gupta, Arpi
    Many-objective optimization problems (MaOPs) are multi-objective optimization problems which have more than three objectives. MaOPs face significant challenges because of search efficiency, computational cost, decision ...
  • 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 ...
  • Passive Solar Building Design Using Genetic Programming 

    Oraei Gholami, Mohammad Mahdi (Brock University, 2013-10-28)
    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 

    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 (n,k)-Arrangement Graphs and Augmented Cubes 

    Motevallibashi, Nafiseh
    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 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 ...
  • Properties and Algorithms of the KCube Graphs 

    Zhao, Li (Brock University, 2014-03-24)
    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 

    Noroozi, Keivan
    The KCube interconnection network was first introduced in 2010 in order to exploit the good characteristics of two well-known interconnection networks, the hypercube and the Kautz graph. KCube links up multiple processors ...
  • 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 ...
  • Real-Time Automatic Object Classification and Tracking using Genetic Programming and NVIDIA R CUDA TM 

    Maghoumi, Mehran (Brock University, 2014-08-01)
    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 real-time ...
  • 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 ...
  • Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems 

    Ghosh, Manas (Brock University, 2013-11-05)
    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 Relation-Algebraic Approach to L - Fuzzy Topology 

    Imangazin, Nurbek
    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 ...
  • RelMDD-A Library for Manipulating Relations Based on MDDs 

    Atampore, Francis (Brock University, 2012-09-18)
    Relation algebras is one of the state-of-the-art 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 

    Orth, John (Brock University, 2012-03-02)
    This thesis introduces the Salmon Algorithm, a search meta-heuristic 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 Large-Scale Many-Objective Optimization 

    Maltese, Justin
    Many real-world optimization problems contain multiple (often conflicting) goals to be optimized concurrently, commonly referred to as multi-objective problems (MOPs). Over the past few decades, a plethora of multi-objective ...
  • Shortest Path Routing on the Hypercube with Faulty Nodes 

    Arabpour Niasari, Mehrdad
    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 ...