Browsing Mathematics (Faculty of) by Title
Now showing items 178-197 of 3004
-
Approximation Algorithms for Clustering and Facility Location Problems
(University of Waterloo, 2017-04-06)Facility location problems arise in a wide range of applications such as plant or warehouse location problems, cache placement problems, and network design problems, and have been widely studied in Computer Science and ... -
Approximation Algorithms for Distributionally Robust Stochastic Optimization
(University of Waterloo, 2019-05-15)Two-stage stochastic optimization is a widely used framework for modeling uncertainty, where we have a probability distribution over possible realizations of the data, called scenarios, and decisions are taken in two stages: ... -
Approximation Algorithms for Geometric Covering Problems for Disks and Squares
(University of Waterloo, 2013-08-15)Geometric covering is a well-studied topic in computational geometry. We study three covering problems: Disjoint Unit-Disk Cover, Depth-(≤ K) Packing and Red-Blue Unit-Square Cover. In the Disjoint Unit-Disk Cover ... -
Approximation Algorithms for Graph Protection Problems
(University of Waterloo, 2015-05-22)We study a budgeted cut problem known as Graph Protection, where the goal is to remove edges of a given graph in order to protect valuable nodes from stochastic, infectious threats. This problem was recently proposed ... -
Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations
(University of Waterloo, 2015-07-29)Linear programming (LP) relaxations provide a powerful technique to design approximation algorithms for combinatorial optimization problems. In the first part of the thesis, we study the metric s-t path Traveling Salesman ... -
Approximation Algorithms for Rectangle Piercing Problems
(University of Waterloo, 2005)Piercing problems arise often in facility location, which is a well-studied area of computational geometry. The general form of the piercing problem discussed in this dissertation asks for the minimum number of facilities ... -
Approximation Constants for Closed Subschemes of Projective Varieties
(University of Waterloo, 2019-06-19)Diophantine approximation is a branch of number theory with a long history, going back at least to the work of Dirichlet and Liouville in the 1840s. The innocent-looking question of how well an arbitrary real algebraic ... -
Approximation, Proof Systems, and Correlations in a Quantum World
(University of Waterloo, 2012-08-29)This thesis studies three topics in quantum computation and information: The approximability of quantum problems, quantum proof systems, and non-classical correlations in quantum systems. Our first area of study concerns ... -
An Architecture for Geographically-Oriented Service Discovery on the Internet
(University of Waterloo, 2002)Most of the service discovery protocols available on the Internet are built upon its logical structure. This phenomenon can be observed frequently from the way in which they behave. For instance, Jini and SLP service ... -
An Architecture For Multi-Agent Systems Operating In Soft Real-Time Environments With Unexpected Events
(University of Waterloo, 2004)In this thesis, we explore the topic of designing an architecture and processing algorithms for a multi-agent system, where agents need to address potential unexpected events in the environment, operating under soft ... -
Are machine learning corpora “fair dealing” under Canadian law?
(Proceedings of the 12th International Conference on Computational Creativity, 2021-09)We consider the use of large corpora for training compuationally creative systems, particularly those that write new text based on the style of an existing author or genre. Under Canadian copyright law, a key concern for ... -
Area-Efficient Drawings of Outer-1-Planar Graphs
(University of Waterloo, 2020-09-29)We study area-efficient drawings of planar graphs: embeddings of graphs on an integer grid so that the bounding box of the drawing is minimized. Our focus is on the class of outer-1-planar graphs: the family of planar ... -
Armitage Lecture 2011: The Design and Analysis of Life History Studies
(Wiley, 2013)Life history studies collect information on events and other outcomes during people’s lifetimes. For example, these may be related to childhood development, education, fertility, health, or employment. Such longitudinal ... -
Artin's Conjecture: Unconditional Approach and Elliptic Analogue
(University of Waterloo, 2008-08-11)In this thesis, I have explored the different approaches towards proving Artin's `primitive root' conjecture unconditionally and the elliptic curve analogue of the same. This conjecture was posed by E. Artin in the year ... -
Artin's Primitive Root Conjecture and its Extension to Compositie Moduli
(University of Waterloo, 2008-08-11)If we fix an integer a not equal to -1 and which is not a perfect square, we are interested in estimating the quantity N_{a}(x) representing the number of prime integers p up to x such that a is a generator of the cyclic ... -
Asking for Help with a Cost in Reinforcement Learning
(University of Waterloo, 2020-05-15)Reinforcement learning (RL) is a powerful tool for developing intelligent agents, and the use of neural networks makes RL techniques more scalable to challenging real-world applications, from task-oriented dialogue systems ... -
An Aspect-Oriented Approach to Design and Develop Hypermedia Documents
(University of Waterloo, 2005)Hypermedia applications can be defined as collections of interactive multimedia documents that are organized as a hypertext net. The variety of application domains and the complexity of the relationship among the application ... -
Aspect-Oriented Smart Proxies in Java RMI
(University of Waterloo, 2008-05-21)Java's Remote Method Invocation (RMI) architecture allows distributed applications to be written in Java. Clients can communicate with a server via a local proxy object that hides the network and server implementation ... -
Aspects of Metric Spaces in Computation
(University of Waterloo, 2008-06-06)Metric spaces, which generalise the properties of commonly-encountered physical and abstract spaces into a mathematical framework, frequently occur in computer science applications. Three major kinds of questions about ... -
Aspects of Quantum Field Theory in Enumerative Graph Theory
(University of Waterloo, 2022-10-24)While a quantum field theorist has many uses for mathematics of all kinds, the relationship between quantum field theory and mathematics is far too fluid in the world of modern research to be described as the simple provision ...