Now showing items 9-28 of 38

  • Enabling and Measuring Complexity in Evolving Designs using Generative Representations for Artificial Architecture 

    Harrington, Adrian (Brock University, 2012-11-07)
    As the complexity of evolutionary design problems grow, so too must the quality of solutions scale to that complexity. In this research, we develop a genetic programming system with individuals encoded as tree-based ...
  • Equational Reasoning about Object-Oriented Programs 

    Hossain, Md. Nour (2013-04-08)
    Formal verification of software can be an enormous task. This fact brought some software engineers to claim that formal verification is not feasible in practice. One possible method of supporting the verification process ...
  • Evolution of architectural floor plans 

    Flack, Robert W. J. (Brock University, 2011-10-13)
    Layout planning is a process of sizing and placing rooms (e.g. in a house) while a t t empt ing to optimize various criteria. Often the r e are conflicting c r i t e r i a such as construction ...
  • Evolutionary synthesis of stochastic gene network models using feature-based search spaces 

    Imada, Janine. (Brock University, 2009-01-28)
    A feature-based fitness function is applied in a genetic programming system to synthesize stochastic gene regulatory network models whose behaviour is defined by a time course of protein expression levels. Typically, ...
  • Extending relAPS to first order logic 

    Aameri, Bahar (Brock University, 2011-03-08)
    RelAPS is an interactive system assisting in proving relation-algebraic theorems. The aim of the system is to provide an environment where a user can perform a relation-algebraic proof similar to doing it using pencil ...
  • Formalizing affordances in situation 

    Lenarcic, Adam (2012-04-03)
    The representation of a perceptual scene by a computer is usually limited to numbers representing dimensions and colours. The theory of affordances attempted to provide a new way of representing an environment, with ...
  • Generating Aesthetically Pleasing Images in a Virtual Environment using Particle Swarm Optimization 

    Barry, William (Brock University, 2012-11-07)
    This research focuses on generating aesthetically pleasing images in virtual environments using the particle swarm optimization (PSO) algorithm. The PSO is a stochastic population based search algorithm that is inspired ...
  • Generating finite integral relation algebras 

    Zhang, Si (Brock University, 2011-03-08)
    Relation algebras and categories of relations in particular have proven to be extremely useful as a fundamental tool in mathematics and computer science. Since relation algebras are Boolean algebras with some well-behaved ...
  • Generating Relation Algebras for Qualitative Spatial Reasoning 

    Siddavaatam, Prathap (2013-04-15)
    Basic relationships between certain regions of space are formulated in natural language in everyday situations. For example, a customer specifies the outline of his future home to the architect by indicating which rooms ...
  • Generator Matrix Based Search for Extremal Self-Dual Binary Error-Correcting Codes 

    Derka, Martin (Brock University, 2012-09-18)
    Self-dual doubly even linear binary error-correcting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5-designs. Extremal codes are codes that have the largest ...
  • Genetic Programming for Non-Photorealistic Rendering 

    Baniasadi, Maryam (Brock University, 2013-04-18)
    This thesis focuses on developing an evolutionary art system using genetic programming. The main goal is to produce new forms of evolutionary art that filter existing images into new non-photorealistic (NPR) styles, by ...
  • Genetic programming for the RoboCup Rescue Simulation System 

    Runka, Andrew (Brock University, 2011-03-08)
    The Robocup Rescue Simulation System (RCRSS) is a dynamic system of multi-agent interaction, simulating a large-scale urban disaster scenario. Teams of rescue agents are charged with the tasks of minimizing civilian ...
  • Heuristics for the Critical Node Detection Problem in Large Complex Networks 

    Edalatmanesh, Mahmood (Brock University, 2013-09-12)
    Complex networks have recently attracted a significant amount of research attention due to their ability to model real world phenomena. One important problem often encountered is to limit diffusive processes spread over ...
  • Improving Short DNA Sequence Alignment with Parallel Computing 

    Peters, Darren (2013-04-11)
    Variations in different types of genomes have been found to be responsible for a large degree of physical diversity such as appearance and susceptibility to disease. Identification of genomic variations is difficult and ...
  • Improving the Scalability of Reduct Determination in Rough Sets 

    Mahmood, Shahid (2013-04-09)
    Rough Set Data Analysis (RSDA) is a non-invasive data analysis approach that solely relies on the data to find patterns and decision rules. Despite its noninvasive approach and ability to generate human readable rules, ...
  • An Interactive Theorem Prover for First-Order Dynamic Logic 

    Das, Tuhin Kanti (Brock University, 2012-10-11)
    Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs. The method of proving correctness of properties of a computer program using the well-known Hoare Logic can be ...
  • A Multi-Objective Genetic Algorithm with Side Effect Machines for Motif Discovery 

    Alizadeh Noori, Farhad (Brock University, 2012-09-18)
    Understanding the machinery of gene regulation to control gene expression has been one of the main focuses of bioinformaticians for years. We use a multi-objective genetic algorithm to evolve a specialized version of ...
  • Multi-Objective Genetic Algorithms for the Single Allocation Hub Location Problem 

    Asobiela, Stephen Yamzuuga (Brock University, 2013-09-12)
    Hub Location Problems play vital economic roles in transportation and telecommunication networks where goods or people must be efficiently transferred from an origin to a destination point whilst direct origin-destination ...
  • 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 ...