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 6 of 6 for “"polynomial algorithms"”.
-
Computational Hardness in Random Optimization Problems from the Overlap Gap Property
We study the limits of efficient algorithms in random optimization problems. In these problems, we are given a random objective function and our goal is to find an input achieving a large output. These problems often exhibit information-computation gaps, where the maximum objective that exists is …
-
Polynomial Time Algorithms for Transportation and Inventory Management in Serial Supply Chain with Multi-Module Capacitated Vehicles
… are NP-hard when n is part of the input and polynomially solvable for n = 1, the complexity status for fixed n ≥ 2 has remained open. We resolve this question by developing exact fixed-parameter tractable algorithms that solve MCLS and MCLS-S in O(T2n+3) time for any fixed n ≥ 2. Our results …
-
Multi-criteria Mapping and Scheduling of Workflow Applications onto Heterogeneous Platforms
… results, and provide several efficient polynomial heuristics for NP-complete instances of the problem. * Pipeline workflow applications * We consider workflow applications that can be expressed as linear pipeline graphs. An example for this application type is digital image processing, …
-
Supervised classification and network location problems via mathematical optimization
… along the network. Furthermore, we present two polynomial algorithms for finding the location that minimizes the maximal regret assuming that the demand realization is an unknown constant or linear function on each edge. We also include two illustrative examples as well as a computational study …
-
Polynomial-Time Reasoning Support for Design and Maintenance of Large-Scale Biomedical Ontologies
Description Logics (DLs) belong to a successful family of knowledge representation formalisms with two key assets: formally well-defined semantics which allows to represent knowledge in an unambiguous way and automated reasoning which allows to infer implicit knowledge from the one given …