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 2124 for “"parameterized"”.
-
Parameterized randomization
Die Arbeit entwickelt einen theoretischen Rahmen für parametrische randomisierte Komplexität. Außerdem wird die Theorie von Kernelisierungen (parametrische Datenkompression) behandelt. Schließlich enthält die Arbeit Grundlegendes zur parametrischen average-case Komplexität.
-
On parameterized counting
… have tried to analyze the intrinsic hardness of parameterized counting problems. We have analyzed the parameterized complexity of #W(P)-complete problems. We proved that, (under some complexity theoretic hypothesis): <br>1. Any #W(P)-complete is harder than any problem in the A hierarchy. <br>2. …
-
Parameterized monads in linguistics
… theories. Specifically, this dissertation uses parameterized monads, a particular theoretical framework in category theory, as a dynamic semantic framework to reinterpret the compositional Discourse Representation Theory(cDRT), and to provide an analysis of donkey anaphora. Parameterized monads …
-
Analysis of Parameterized Networks
In particular, the thesis will focus on parameterized networks of discrete-event systems. These are collections of interacting, isomorphic subsystems, where the number of subsystems is, for practical purposes, arbitrary; thus, the system parameter of interest is, in this case, the size of the …
-
Parameterized modular inverse reinforcement learning
… learning, and developed what we called a parameterized modular inverse reinforcement learning algorithm. We first demonstrate the correctness and efficiency of our algorithm in a simulated navigation task. We then show that our algorithm is able to estimate a reward function and discount …
-
Model checking parameterized process classes
… communicating with each other are known as parameterized systems.Such systems are common in distributed computing and real-life software systems.Verifying properties for such systems involves reasoning about unboundedly manyprocesses and hence cannot be accomplished directly by …
-
Characterizing Hardness in Parameterized Complexity
Parameterized complexity theory relaxes the classical notion of tractability and allows to solve some classically hard problems in a reasonably efficient way. However, many problems of interest remain intractable in the context of parameterized complexity. A completeness theory to categorize such …
-
Parameterized Strings: Algorithms and Applications
The parameterized string (p-string), a generalization of the traditional string, is composed of constant and parameter symbols. A parameterized match (p-match) exists between two p-strings if the constants match exactly and there exists a bijection between the parameter symbols. Historically, …
-
Parameterized sequential decision making problems
Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2023-12-01
-
Sketch-based modeling of parameterized objects
This thesis presents a modeling system that constructs 3D models of particular object classes, such as cups, airplanes, and fish, from 2D sketches. The core of the system is a sketch recognition algorithm that seeks to match the points and curves of a set of given 2D templates to the sketch. The …
-
Parameterized Code Generation From Template Semantics
We have developed a tool that can create a Java code generator for a behavioural modelling notation given only a description of the notation's semantics as a set of parameters. This description is based on template semantics, which has previously been used to describe a wide variety of notations. …
-
Building Parameterized Action Representations From Observation
… of actions within a framework called Parameterized Action Representation (PAR). Just as a person may learn a new complex physical task by observing another person doing it, our system observes a single trial of a human performing some complex task that involves interaction with self or …
-
Parameterized Strings: Algorithms and Data Structures
A parameterized string (p-string) T = T[1] T[2]...T[n] is a sophisticated string of length n composed of symbols from a constant alphabet Sigma and a parameter alphabet pi. Given a pair of p-strings S and T, the parameterized pattern matching (p-match) problem is to verify whether the individual …
-
High-dimensional data driven parameterized macromodeling
L'abstract è presente nell'allegato / the abstract is in the attachment
-
A Parameterized Simulation of Doppler Lidar
… of such an instrument. LadarSIM is a robust parameterized simulation tool developed for time of flight lidar at Utah State University's Center for Advanced Imaging Ladar. This thesis outlines how LadarSIM was modified to include a simulation of Doppler lidar. A study is performed using …
-
Abstraction-based verification of parameterized networks
The thesis presents a method to verify parameterized networks of finite state processes. The method is based on three main ideas. The first one consists in modeling an infinite family of networks by a single WS1S transition system, that is, a transition system whose variables are set (2nd-order) …
-
Parameterized query complexity in quantum computation
Given a function promised to be constant or balanced. Deutsch's algorithm and it's extension Deutsch-Jozsa are the algorithms that can determine the property of the function in constant number of queries. The algorithm works only on the functions that are promised to be either constant or balanced. …
-
SMT-based Verification of Parameterized Systems
… thesis delves into SMT-based verification of parameterized systems, emphasizing the challenges and novel solutions in verifying systems with an unbounded number of components. In this thesis, we first introduce a general framework to model such systems. Then, we introduce two novel algorithms …
Page 1 of 107