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 50 for “"DYNAMIC ALGORITHMS"”.
-
Dynamic Algorithms for Partially-Sorted Lists
The dynamic partial sorting problem asks for an algorithm that maintains lists of numbers under the link, cut and change value operations, and queries the sorted sequence of the k least numbers in one of the lists. We examine naive solutions to the problem and demonstrate why they are not adequate. …
-
Dynamic algorithms for chordal and interval graphs
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, (2) delete or insert an arbitrary edge, provided it preserves chordality. We …
-
ONLINE AND DYNAMIC ALGORITHMS FOR REVENUE MANAGEMENT APPLICATIONS
In this thesis, we propose algorithms for various classic online OR problems. First, we study the online reusable resource allocation problems with multi-class arrivals under adversarial environment, including problems of admission control, advance booking and assortment planning. We propose …
-
Dynamic Algorithms for Sensor Scheduling and Adversary Path Prediction
In this thesis we describe three new dynamic, real time and robust sensor scheduling algorithms for intruder tracking and sensor scheduling. We call them Tactic Association Based Algorithm (TABA), Tactic Case Based Algorithm (TCBA) and Tactic Weight Based Algorithm (TWBA). The algorithms are …
-
Dynamic Algorithms and Asymptotic Theory for Lp-norm Data Analysis
… the development of outlier-resistant stochastic algorithms for Principal Component Analysis (PCA) and the derivation of novel asymptotic theory for Lp-norm Principal Component Analysis (Lp-PCA). Modern machine learning and signal processing applications employ sensors that collect large volumes …
-
Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions
… We also apply this technique to the dynamic version of the minimum enclosing ball problem (in the non-streaming setting). We give an O(dn)-space data structure that can maintain a 1.22-approximate minimum enclosing ball in O(dlog n) expected amortized time per insertion/deletion. …
-
Theater air apportionment and allocation: application of dynamic algorithms for combat models
… develop, and demonstrate a decision model to dynamically apportion and allocate air assets in a theater level combat model subject to specified air campaign plan. The methods described are combined into a stand-alone air apportionment I air allocation (AA)2 model. The model translates the …
-
Unrestricted dynamic Gröbner Basis algorithms
… and cryptography. Traditional Gröbner Basis algorithms are static, in the sense that they receive a monomial order as input and it is fixed during the entire execution of the algorithm. Dynamic algorithms, in contrast, allow this monomial ordering to change to generate smaller output bases …
-
Molekulinės dinamikos programų integracija statistinės kalbos R aplinkoje: kai kurių algoritmų realizacija panaudojant C/C++ sąsają /
… R system’s abilities to accept molecular dynamic algorithms written in C/C++ language via C/C++ interfaces (provided by R itself). We also review other interfaces created for R and R system’s extended functionality contributed by packages and external programs. The practical value of this …
-
Dinaminiai grafų spalvinimo algoritmai /
Dynamic Algorithms for Graph Coloring.
-
Materialized View Algorithms
… in a data warehouse. Several static and dynamic algorithms for selecting materialized aggregate views (MAV) in a data warehouse are proposed in this thesis. The algorithms are then compared by running a simulation system, which can be configured to compare several algorithms on different …
-
Dynamic Scheduling Algorithms: Theory and Practice
In this thesis we investigate the dynamic problems of interval scheduling. The emphasis is on interval scheduling in the following contexts: single machine, multiple machines, and elastic mixed-criticality real-time systems. We analyze the complexity of these problems and find dynamic algorithms …
-
Satellite specific multiple access control algorithms for packet data
This thesis investigates the ability of dynamic algorithms to adequately share limited satellite channel resources between explicit user demands for bandwidth, anticipated bandwidth demands from users, and signalling traffic transmitted from user terminals. In particular it investigates the design …
-
Numerical and streaming analyses of centrality measures on graphs
… being produced, leading to the notion of dynamic graphs. When analyzing large graphs, a common problem of interest is to identify the most important vertices in a graph, which can be done using centrality metrics. This dissertation presents novel advances in the field of graph analysis by …
-
Estimating Reachability Set Sizes in Dynamic Graphs
… Further, most real world networks are dynamic, i.e., they change over time. Therefore there is a need for efficient dynamic algorithms that offer good space-time trade-offs. In this thesis we study the problem of computing the reachability set size of a vertex, which is a fundamental …
-
Αλγόριθμοι δυναμικής δρομολόγησης εφαρμογών που περιέχουν φωλιασμένους βρόχους σε ετερογενή δίκτυα υπολογιστών
… was focused in the establishment of efficient algorithms for the parallelization of nested loops containing dependencies in distributed systems (networks of computers). Distributed systems offer an attractive environment for the execution of parallel applications because of the cost benefit …
-
Symmetric data structure for conjugate computation, distance, and sensitivity analysis of convexity for bivariate convex piecewise linear quadratic functions
… objective of this thesis is to develop efficient algorithms and data structures appropriate to support future dynamic algorithms for the conjugate operator in the Computational Convex Analysis (CCA) toolbox for piecewise-defined functions. The CCA toolbox implements efficient tools for computing …
-
Strategies in Botnet Detection and Privacy Preserving Machine Learning
… repeatedly on the network snapshots of the dynamic networks. We propose DynaMo, a novel modularity-based dynamic community detection algorithm, aiming to detect communities of dynamic networks as effective as repeatedly applying static algorithms but in a more efficient way. In the …
-
Preserving large cuts in fully dynamic graphs
… the study of the MAX-CUT problem in fully dynamic graphs. Given a graph $G=(V,E)$, we present the first fully dynamic algorithms to maintain a $\frac{1}{2}$-approximate cut in sublinear update time under edge insertions and deletions to $G$. Our results include the following deterministic …
-
Mapping parallel graph algorithms to throughput-oriented architectures
… that the GPU architecture is well-suited to algorithms that search and analyze unstructured, graph-based data, offering up to an order of magnitude greater memory bandwidth over their CPU counterparts. This thesis focuses on GPU graph analysis from the perspective that algorithms should be …
Page 1 of 3