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 13906 for “"Algorithms."”.
-
Intuitive algorithms
… Both the concepts of moderately exponential time algorithms and parameterized complexity provide tools for solving many of these problems in reasonable time. In this thesis, we introduce the concept of intuitive algorithms. While intuitive algorithms can be either moderately exponential time …
-
Strategic algorithms
Classical algorithms from theoretical computer science arise time and again in practice. However,a practical situations typically do not fit precisely into the traditional theoretical models. Additional necessary components are, for example, uncertainty and economic incentives. Therefore, modem …
-
Quantum algorithms
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Physics, 1999.
-
Satisfiability Algorithms and Connections between Algorithms and Circuit Lower Bounds
In this thesis we study satisfiability algorithms and connections between algorithms and circuit lower bounds. We give new results in the following three areas: Oracles and Algorithmic Methods for Proving Lower Bounds: We give an equivalence between relativizing circuit lower bounds (circuit lower …
-
Hybrid Genetic Algorithms
Genetic algorithms (GAs), a class of evolutionary algorithms, emerging to be a promising procedure for solving engineering optimization problems. As GAs are able to conduct global search with minimal simplifying assumptions about the problem as well as the corresponding decision space, they offer a …
-
S-GAME ALGORITHMS.
S-GAME ALGORITHMS.<p></p>
-
Decentralized Network Algorithms
… the performance of several piece selection algorithms, and also develop algorithms that ensure efficient dissemination of all pieces to all users.
-
Parallelisation of algorithms
… message routing and parallelisation of algorithms. In particular, it deals with these aspects with reference to the Transputer as developed by INMOS and includes two parallelisation examples, namely parallelisation of code to study airflow and of code to determine far field patterns of …
-
Graph bisection algorithms
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1986.
-
Actor-critic algorithms
… this thesis, we propose and study actor-critic algorithms which combine the above two approaches with simulation to find the best policy among a parameterized class of policies. Actor-critic algorithms have two learning units: an actor and a critic. An actor is a decision maker with a tunable …
-
Learning-Augmented Algorithms
Traditional worst case analysis of algorithms does not fully capture real world behavior in many instances. Inspired by the great success of machine learning algorithms for various practical tasks, there has been recent interest in moving beyond pessimistic analysis of algorithms through the use of …
-
Cache-oblivious algorithms
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
-
Dynamic matching algorithms
… waiting. Until now, the theory of matching algorithms has focused mostly on static environments and little is known in the case where all participants arrive and depart dynamically. In our second part, we help bridge this gap by introducing a new theoretical problem for dynamic matching when …
-
Fast geometric algorithms
… includes sorting and selection, convex hull algorithms, the L₁ hull, determination of the minimum encasing rectangle of a set of points, the Euclidean and L₁ diameter of a set of points, the metric traveling salesman problem, and finding the superrange of starshaped and monotone polygons. The …
-
Algorithms on Majority Problem
… than. The focus of the paper is to propose algorithms for these problems and analyze their time complexity. For both versions we show O(n) time algorithms. These results could be compared with cases whose elements can be ordered. The paper has also been modified to give the solution to the …
-
Adaptive global optimization algorithms
… and expected error of similar deterministic algorithms. Recent algorithms are investigated, new ones proposed and their performance is analyzed. Minimum, maximum and average case error bounds for the algorithms presented are derived. Software architecture implemented with MATLAB and Java is …
-
From Biology to Algorithms
… the principled design of biologically-inspired algorithms. It is argued that modelling a biological system can be tremendously helpful in eventual algorithm construction. A proposal is made that it is possible to reduce modelling biases by modelling the biological system without any regard to …
Page 1 of 696