Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 28 for “"Models Of Computation"”.
-
Explicit pseudorandom distributions for restricted models of computation
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-02-04 without embargo terms
-
A Computational Paradigm on Network-Based Models of Computation
<p>The maturation of computer science has strengthened the need to consolidate isolated algorithms and techniques into general computational paradigms. The main goal of this dissertation is to provide a unifying framework which captures the essence of a number of problems in seemingly unrelated …
-
Towards reliable organisms: fault-tolerance in unconventional models of computation
Computation is often described in abstract and idealized terms. In this setting, the details of the computer can be neglected: different models of computation are interchangeable for a cost which is at most polynomial in the size of the task at hand. The situation is more complicated for computers …
-
Some hardness escalation results in computational complexity theory
… we prove new hardness escalation results in computational complexity theory; a phenomenon where hardness results against seemingly weak models of computation for any problem can be lifted, in a black box manner, to much stronger models of computation by considering a simple gadget composed …
-
Average-case complexity of detecting cliques
The computational problem of testing whether a graph contains a complete subgraph of size k is among the most fundamental problems studied in theoretical computer science. This thesis is concerned with proving lower bounds for k-CLIQUE, as this problem is known. Our results show that, in certain …
-
The Differential Scheme and Quantum Computation
<p>It is well-known that standard models of computation are representable as simple dynamical systems that evolve in discrete time, and that systems that evolve in continuous time are often representable by dynamical systems governed by ordinary differential equations. In many applications, e.g., …
-
Games meet Concurrency: Algorithms and Hardness
Since the turn of the 21st century, seeing the decline of Moore’s Law on the horizon, the pursuit of continued software performance gains has led to the prominence of computer architectures with high degrees of parallelism and memory cache hierarchies. However, there are still many challenges to …
-
Asynchronous algorithms for shared memory machines
In an effort to develop more realistic models of computation, we introduce several asynchronous shared memory machines and design asynchronous algorithms for those machines. We first model asynchronous protocols for communication across unreliable channels using finite-state machines communicating …
-
The design and implementation of a language environment for evaluating the programming task
… the requirement, design, and implementation of a software package that can be used to perform quantitative studies on certain aspects of a programming task. Of specific interest are experiments with the level of interactiveness of the human-computer interface relating to program construction …
-
Visual programming in three dimensions : visual representations of computational mental models
… form and is intended to be read by humans. One of the goals of this work is to improve the readability and expression of complex interactions in code. The current visual programming environments that see the most use inside, and outside of Architecture present computation in specific terms. I …
-
Translation of Heterogeneous High-level Models to Lower Level Design Languages
… one develops an abstract mathematical model of a system, or portion of a system. This model of a system is validated to insure that the specification is interpreted accurately and to explore different algorithms for implementing the system behavior. We use the words "portion of a system," …
-
New directions in sublinear algorithms and testing properties of distributions
… with sublinear algorithms for various types of problems in statistics, combinatorial optimization and graph algorithms. A first focus of this thesis is algorithms for testing whether a probability distribution, to which the algorithms have sample access, is equal to a given hypothesis …
-
Tackling Algorithmic Problems on Massive Graphs
As datasets grow increasingly larger, traditional computational models, which require reading the entire input, become impractical due to constraints on time, memory, and randomness. This thesis explores alternative algorithmic approaches for processing massive graphs under these constraints. …
-
HEMLOCK: HEterogeneous ModeL Of Computation Kernel for SystemC
… is the facility to express different Models Of Computation (MOC). Currently, all SystemC models employ a Discrete-Event simulation kernel making it difficult to express most MOCs without specific designer guidelines. This often makes it unnatural to express different MOCs in SystemC. …
-
Reversibility for efficient computing
… and are now becoming practical. In traditional models of computation, pure reversibility seems to decrease overall computational efficiency; I provide a proof to this effect. However, traditional models ignore important physical constraints on information processing. This thesis gives the first …
-
Ingredients for Successful System Level Automation & Design Methodology
This dissertation addresses the problem of making system level design (SLD) methodology based on SystemC more useful to the complex embedded system design community by presenting a number of ingredients currently absent in the existing SLD methodologies and frameworks. The complexity of embedded …
-
Computation in models inspired by near-term quantum devices
… gates will be an important gate set because of their close connection to stabilizer codes (being both necessary to encode qubits, and easily implemented on encoded logical qubits). Finally, the limited lifespan of qubits (due to various forms of noise) encourages shallow circuits, at least …
-
Analysis of neural circuits in vitro
This thesis is a collection of manuscripts addressing connectivity of neural circuits in cultured hippocampal neurons. These studies begin with an investigation of dopaminergic modulation of excitatory synapses in small circuits of neurons grown on glial micro islands. We found that dopamine …
-
A domain specific language for facilitating automatic parallelization and placement of SDR patterns into heterogeneous computing architectures
… presents a domain-specific language (DSL) for software defined radio (SDR) which is referred to as OptiSDR. The main objective of OptiSDR is to facilitate the development and deployment of SDR applications into heterogeneous computing architectures (HCAs). As HCAs are becoming mainstream in SDR …
-
The Trainability and Expressivity of Quantum Machine Learning Models
… more and more evidence that precise control of many-body quantum systems yields a method of computation more powerful than what is achievable using conventional models of computation. This culminated in recent years with experimental demonstrations on quantum devices of computational tasks on …
Page 1 of 2