## Search

Now showing items 31-40 of 106

#### Algebraic Aspects of Multi-Particle Quantum Walks

(University of Waterloo, 2012-12-04)

A continuous time quantum walk consists of a particle moving among the vertices of a graph G. Its movement is governed by the structure of the graph. More formally, the adjacency matrix A is the Hamiltonian that determines ...

#### Highly Non-Convex Crossing Sequences

(University of Waterloo, 2012-05-18)

For a given graph, G, the crossing number crₐ(G) denotes the minimum number of edge crossings when a graph is drawn on an orientable surface of genus a. The sequence cr₀(G), cr₁(G), ... is said to be the crossing sequence ...

#### Flocking for Multi-Agent Dynamical Systems

(University of Waterloo, 2012-08-24)

In this thesis, we discuss models for multi-agent dynamical systems. We study the tracking/migration problem for flocks and a theoretical framework for design and analysis of flocking algorithm is presented. The interactions ...

#### The non-injective hidden shift problem

(University of Waterloo, 2012-01-19)

In this work, we mostly concentrate on the hidden shift problem for non-injective functions. It is worthwhile to know that the query complexity of the non-injective hidden shift problem is exponential in the worst case by ...

#### A Gradual Non-Convexation Penalty Method for Minimizing VaR

(University of Waterloo, 2012-05-08)

This thesis investigates the portfolio optimization problem using Value-at-Risk (VaR) as a risk measure, when m sample scenarios are given. Minimizing VaR of a portfolio is computationally difficult: it is non-convex, ...

#### Some Theory and Applications of Probability in Quantum Mechanics

(University of Waterloo, 2012-07-19)

This thesis investigates three distinct facets of the theory of quantum information. The first two, quantum state estimation and quantum process estimation, are closely related and deal with the question of how to estimate ...

#### Online Trace Reordering for Efficient Representation of Event Partial Orders

(University of Waterloo, 2012-01-20)

Distributed and parallel applications not only have distributed state but are often
inherently non-deterministic, making them significantly more challenging to monitor and
debug. Additionally, a significant challenge ...

#### Reducing the Cost of Operating a Datacenter Network

(University of Waterloo, 2012-05-01)

Datacenters are a significant capital expense for many enterprises. Yet, they are difficult to manage and are hard to design and maintain. The initial design of a datacenter network tends to follow vendor guidelines, but ...

#### LP-based Approximation Algorithms for the Capacitated Facility Location Problem

(University of Waterloo, 2012-05-18)

The capacitated facility location problem is a well known problem in combinatorial optimization and operations research. In it, we are given a set of clients and a set of possible facility locations. Each client has a ...

#### The discontinuous Galerkin method on Cartesian grids with embedded geometries: spectrum analysis and implementation for Euler equations

(University of Waterloo, 2012-09-21)

In this thesis, we analyze theoretical properties of the discontinuous Galerkin method (DGM) and propose novel approaches to implementation with the aim to increase its efficiency. First, we derive explicit expressions ...