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 8 of 8 for “"Discrete combinatorial optimization"”.
-
Particle swarm optimization for two-connected networks with bounded rings
… in the event of failures. Particle Swarm Optimization (PSO) is a stochastic population-based optimization technique modeled on the social behaviour of flocking birds or schooling fish. This thesis applies PSO to the 2CNBR problem. As PSO is originally designed to handle a continuous …
-
Problems in investigation theory
Investigation theory treats discrete combinatorial optimization problems in which there are several objects passing through a region containing one or more investigators who are to investigate, according to some criteria, objects prior to their escape across a portion of the boundary of the region. …
-
Consensus Algorithms for Trees and Strings
… polynomial-time approximability of a number of discrete combinatorial optimization problems involving labeled trees and strings. The problems considered have applications to computational molecular biology, pattern matching, and many other areas of computer science. The thesis is divided into …
-
Holistic interpretation of visual data based on topology:semantic segmentation of architectural facades
… algorithm is able to solve a single optimization function and yield a semantic interpretation of facades, relying on the modeling power of probabilistic graphs and efficient discrete combinatorial optimization tools. We tackle the same problem of semantic facade segmentation with the …
-
Water resources decision making using meta-heuristic optimization methods
… focus was to investigate meta-heuristic (global) optimization methods suitable for developing water resources decision support system (DSS), particularly to optimally design and operate groundwater storage and recovery projects. The effort included developing an integrated simulation-optimization …
-
Deterministic Annealing for Correspondence, Pose, and Recognition
… Most existing techniques approach this as a combinatorial optimization problem in which the space of model-to-image feature correspondence is searched in order to find object poses that are supported by large numbers of image features. These approaches, however, are only practical when the …
-
Optimizing task placement in robotic cells
… number of parameters possible. Hence, faster optimization process and more precise results are obtained. Another challenge is in motion planning of redundant cells. Because there can be infinite solutions for such cells, there is room for optimization. In this work, we propose methods to fix …
-
Σχεδίαση δικτύων επίγειας ψηφιακής ευρυεκπομπής βασισμένη σε περιοχές εκχώρησης πόρων
… versions, based on the exploited stochastic optimization technique (SA, TS and GA). The algorithm's performance is evaluated against the basic sequential packing algorithm and observations are made on the spectrum efficiency and the balance of the returned solutions. 19 generated problem …