UVicSpace

Theses (Computer Science)

Theses (Computer Science)

 

Recent Submissions

  • Santoso, Yudi (2018-08-14)
    Triangle enumeration is an important element in graph analysis, and because of this it is a topic that has been studied extensively. Although the formulation is simple, for large networks the computation becomes challenging ...
  • Escalante Osuna, Carlos (2018-08-02)
    This dissertation develops a cost model for a particular implementation of the database query language GraphLog. The order in which the subgoals of a GraphLog query are executed has a major effect on the total processing ...
  • Schraefel, Monica M. C. (2018-07-25)
    This project considers the role of conversation in writing by women, specifically, the role of conversational spaces for women’s construction of self within the symbolic. It does this through a consideration of narrative ...
  • Tomczuk, Randal Wade (2018-07-19)
    This dissertation shows that the autocorrelation of switching functions can be effectively utilized in combinational logic optimization and synthesis. The procedures developed exploit information contained in the ...
  • Hailett, Micheiel Trevor (2018-07-17)
    We perform an Integrated complexity analysis on a number of combinatorial problems arising from the field of computational biology. The classic framework of NP-completeness, algorithmic design techniques for bounded width ...
  • Byrne, Rodrigue (2018-07-11)
    The reliable construction of VLSI integrated circuits (ICs) requires that the ICs be tested after fabrication. An alternative to performing external testing is to create ICs that can test themselves with a built-in self-test ...
  • Walsh, Peter Anthony (2018-07-05)
    Simulated Annealing is a general purpose combinatorial optimization technique which has been applied to many problems in VLSI design. In essence, simulated annealing is Monte Carlo iterative improvement with the ability ...
  • Sun, Xiaoling (2018-07-05)
    This dissertation encompasses primarily design for testability (DFT) problems of concurrent checking and structural off-line Built-In Self-Test. We present a new DFT method, which employs cyclic code checking as a medium ...
  • Ibarra, Louis Walter (2018-07-05)
    We present the first dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting an arbitrary edge preserves chordality, ...
  • Jain, Harshit (2018-07-04)
    In the past few years, the general work habits of people have changed dramatically, raising concerns about their well-being. Numerous health-related problems have been observed from their health records such as obesity, ...
  • Lee, Jimmy Ho Man (2018-07-04)
    Logic programming realizes the ideal of "computation as deduction," except when floating-point arithmetic is involved. In that respect, logic programming languages suffer the same deficiency as conventional algorithmic ...
  • Jain, Roshni (2018-07-04)
    Grocery shopping is a routine task that people perform to fulfill their needs for food. We suspect many people would like to do grocery shopping with the grocery list to save their money and time. While creating a grocery ...
  • Koda, Yasunori (2018-06-29)
    The main results of this dissertation are various algorithms related to partially ordered sets. The dissertation basically consists of two parts. The first part treats algorithms that generate ideals of partially ordered ...
  • Orgun, Mehmet Ali (2018-06-27)
    This dissertation presents an investigation of logic programming based on intensional logic. Through intensional logic, the notion of dynamic change and the ability to reason about context-dependent properties can be brought ...
  • Du, Weichang (2018-06-26)
    Indexical programming means programming languages and/or computational models based on indexical logic and possible world semantics. Indexical languages can be considered as the result of enriching conventional languages ...
  • Lui, Patrick Kam (2018-06-22)
    A new, intuitive approach to the study of a Boolean function using its set of parities of subfunctions called the parity spectrum is presented. This approach simplifies the classical theory of Boolean difference, and serves ...
  • Strooper, Paul Anthony (2018-06-21)
    The use of modules to decompose large software systems into smaller, more manageable, programming tasks is now widely accepted. To benefit from such a decomposition, the requirements of each module have to be defined in a ...
  • Bagai, Rajiv (2018-06-19)
    The work described in this dissertation is mainly a study of some ordinal-theoretic properties of logic programs that are related to the downward powers of their immediate-consequence functions. The downward powers for any ...
  • Cattell, Kevin Michael (2018-06-12)
    A one-dimensional linear hybrid cellular automaton (CA) is a specialised form of linear finite state machine. These machines are of interest, both for their theoretical properties and for their applications in VLSI ...
  • Uhl, James S. (2018-06-12)
    A new control flow model called flow grammars is introduced which unifies the treatment of intraprocedural and interprocedural control flow. This model provides excellent support for the rapid prototyping of flow analyzers. ...

View more