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 25 for “"Exact algorithm"”.
-
Efficient large flow detection over arbitrary windows: an exact algorithm outside an ambiguity region
Being able to exactly detect large network flows under an arbitrary time win- dow model is expected in many current and future applications like Denial- of-Service (DoS) flow detection, bandwidth guarantee, etc. However, to the best of our knowledge, there is no existing work that can achieve exact …
-
Optimal resource allocation In base stations for mobile wireless communications
… we had the following main aims: To design an exact algorithm for the subcarrier and power allocation problem with rate constraints (SPARC), the objective of which is to maximise total data transmission rate of the entire system. To design an exact algorithm for the fractional subcarrier and …
-
Optimal Implementation of Simulink Models on Multicore Architectures with Partitioned Fixed Priority Scheduling
… (MILP) formulation; and (b) a problem specific exact algorithm that may run several magnitudes faster than MILP.
-
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
We present several approximation algorithms for the problem of embedding metric spaces into a line, and into the two-dimensional plane. We give an O([square root] n)-approximation algorithm for the problem of finding a line embedding of a metric induced by a given unweighted graph, that minimizes …
-
Multimodal Fusion With Applications to Audio -Visual Speech Recognition
… inference and learning in CHMMs. The first is an exact algorithm derived by extending the forward-backward procedure used in hidden Markov model (HMM) inference. The second method relies on the model transformation strategy that maps the state space of a CHMM onto the state space of a classic HMM, …
-
Contention Bounds for Locking Computations
… adversary. Although we show that computing the exact optimum is NP-hard for general task graphs, in the restricted case of fork-join (series-parallel) computations with 𝑛 strands and a single lock we offer a Θ(𝑛²) exact algorithm as well as a Θ(𝑛) 2-approximation for worst case contention. In …
-
Integrated multiple sequence alignment
… multiple sequence alignment: existing alignment algorithms are made more easily accessible and new algorithms are designed for difficult cases. Firstly, we introduce the QAlign framework, a graphical user interface for multiple sequence alignment. It comprises several state-of-the-art algorithms …
-
On approximating projection games
… games. Hence, it is important to determine the exact approximation ratio at which projection games become NP-hard to approximate. The goal of this thesis is to make progress towards this problem. First and foremost, we present a polynomial-time approximation algorithm for satisfiable projection …
-
The aircraft sequencing problem with arrivals and departures
… objective of minimizing total weighted delay. Exact algorithms for this problem are not fast enough for practical implementation. WP- give several algorithms that can be used both for the static and the dynamic versions of the problem. These algorithms are not exact solutions, however they are …
-
Routing problems in stochastic time-dependent networks with applications in dynamic traffic assignment
… stochasticity in the development of models and algorithms for dynamic traffic flows in road networks. There are two major parts in this thesis. We first study the best routing policy problems in stochastic and time-dependent networks, and then develop policy-based stochastic dynamic traffic …
-
Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms
An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time. When dealing with NP-hard problems, algorithms can only be expected to possess at most two out of these three desirable …
-
Shirayanagi-Sweedler algebraic algorithm stabilization and polynomial GCD algorithms
… and Sweedler [12] proved that a large class of algorithms on the reals can be modified slightly so that they also work correctly on floating-point numbers. Their main theorem states that, for each input, there exists a precision, called the minimum converging precision (MCP), at and beyond which …
-
Direct Simulation Methods for Multiple Changepoint Problems.
… simplicity and efficiency. We propose an on-line algorithm for exact filtering for a class of multiple changepoint problems. This class of models satisfy an important conditional independence property. This algorithm enables simulation from the true joint posterior distribution of the number and …
-
Algorithms for flows and disjoint paths in planar graphs
In this dissertation we describe several algorithms for computing flows, connectivity, and disjoint paths in planar graphs. In all cases, the algorithms are either the first polynomial-time algorithms or are faster than all previously-known algorithms. First, we describe algorithms for the maximum …
-
Methods to summarize and reduce the solution space of tumor phylogeny inference
… We show that MCT is NP-hard, and present an exact algorithm based on mixed integer linear programming (MILP) and a heuristic algorithm that efficiently identifies high-quality consensus trees. We demonstrate the applicability of our methods on both simulated and real data, showing that our …
-
A hitchhiker’s guide to efficient non-projective dependency parsing
… a paucity of research addressing the fundamental algorithms that allow us to use graph-based dependency parsers. This thesis examines algorithms used in four stages of non-projective, graph-based dependency parsers: inference, sampling, decoding, and significance testing. The thesis will guide the …
-
Assortment and inventory optimization : from predictive choice models to near-optimal algorithms
… generally comes at the detriment of efficient algorithms, which can prescribe near-optimal decisions. This thesis attempts to resolve this disconnect in the context of assortment and inventory optimization, through theoretical and empirical investigation. First, we tightly characterize the …
-
An integrated performance model learning and planning approach for optimal infrastructure facility maintenance under partial observability
… of performance model using the Baum-Welch algorithm. Both offline and online versions of the learning algorithm are presented. The probing-optimizing dichotomy, also known as exploration-exploitation dilemma, in choosing between the best strategy based on the past knowledge of deterioration …
-
Higher Order Asymptotics for the MSE of Robust M-Estimators of Location on Shrinking Total Variation Neighborhoods
… expansions. In the context of determining the exact finite sample risk for sample size n>2 M. Kohl showed in Kohl (2005) that the speed of convergence towards the asymptotic risk is faster by an order in case of total variation compared to convex contamination neighbourhoods. M. Kohl …
Page 1 of 2