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 43 for “"polynomial complexity"”.

  1. Search, polynomial complexity, and the fast messy genetic algorithm

    Blackbox optimization--optimization in presence of limited knowledge about the objective function--has recently enjoyed a large increase in interest because of the demand from the practitioners. This has triggered a race for new high performance algorithms for solving large, difficult problems. …

    uiuc Repository record for Search, polynomial complexity, and the fast messy genetic algorithm (opens in a new tab)

  2. Binary quadratic forms, elliptic curves and Schoof's algorithm

    … forms of given discriminant can be obtained in polynomial complexity using Schoof's algorithm for counting the number of points of elliptic curves over finite fields. It is a remarkable fact that, although an algorithm of Gauss' solved the representation problem long time ago, a solution in …

    trento Repository record for Binary quadratic forms, elliptic curves and Schoof's algorithm (opens in a new tab)

  3. Επεκτάσεις ασαφών περιγραφικών λογικών με κανόνες και απτά πεδία

    … main obstacle towards this direction is the high complexity of the proposed languages. In the worst case, we may propose a DL extension which is undecidable.During our research, we have proposed fuzzy CARIN, a knowledge representation language combining fuzzy Description Logics with (Horn Rules). …

    greece Repository record for Επεκτάσεις ασαφών περιγραφικών λογικών με κανόνες και απτά πεδία (opens in a new tab)

  4. Directed control of discrete event systems

    … directed controller are both solvable in polynomial complexity. Then we present a novel approach with polynomial complexity for the synthesis (and the existence) of an optimal director, thus providing a complete solution to the problems in study.</p>

    iastate Repository record for Directed control of discrete event systems (opens in a new tab)

  5. Codiagnosticabilidade de sistemas a eventos discretos com observação dinâmica

    … cost than the others, although all have polynomial complexity.

    brazil-uerj Repository record for Codiagnosticabilidade de sistemas a eventos discretos com observação dinâmica (opens in a new tab)

  6. Identification of unknown petri net structures from growing observation sequences

    … different time. And the algorithm developed has polynomial complexity. A segment of example code programed according to this algorithm has also been shown. Furthermore, we modify this algorithm and it can check whether a Petri net could fit the observation sequences after several steps. The …

    iupui Repository record for Identification of unknown petri net structures from growing observation sequences (opens in a new tab)

  7. Decentralized/distributed failure diagnosis and supervisory control of discrete event systems

    … delay of their occurrences. Algorithms with polynomial complexity in the size of system/specification models are presented for verifying codiagnosability, computing diagnosis delay bound, synthesizing local diagnosers, and online diagnosis using them. Further diagnosis properties are …

    iastate Repository record for Decentralized/distributed failure diagnosis and supervisory control of discrete event systems (opens in a new tab)

  8. Distributed synchronous diagnosis of discrete-event systems

    … the distributed synchronous diagnosability with polynomial complexity in the state-space of the system component models is proposed.

    brazil-uerj Repository record for Distributed synchronous diagnosis of discrete-event systems (opens in a new tab)

  9. Deadlock Avoidance In Mixed Capacity Flexible Manufacturing Systems

    … addressed the design and implementation of a polynomial-complexity deadlock avoidance controller for a flexible manufacturing cell modeled using Colored Petri Nets. The cell model is robust to changes in the part types to be manufactured in the system and is automatically generated using the …

    usf Repository record for Deadlock Avoidance In Mixed Capacity Flexible Manufacturing Systems (opens in a new tab)

  10. Meta-level pattern analysis for target tracking

    … goal, Bayesian signal processing algorithms with polynomial complexity are also presented. The versatility of such models is illustrated with tracking applications in radar-based and optical surveillance.

    ubc Repository record for Meta-level pattern analysis for target tracking (opens in a new tab) Download PDF for Meta-level pattern analysis for target tracking (opens in a new tab)

  11. Design and Detection of Non-Coherent Unitary Constellations for SIMO Systems for Short Packet Communications

    … optimal error performance but suffer from high complexity in both design and detection. As a result, this approach is not practical for many practical applications. The other approach is the structured unitary constellations with simplified detectors, which can have low complexity in design and …

    sask Repository record for Design and Detection of Non-Coherent Unitary Constellations for SIMO Systems for Short Packet Communications (opens in a new tab)

  12. Δρομολόγηση και αποδοτική ανάθεση χωρητικότητας σε ευρυζωνικά οπτικά δίκτυα

    … initially present a multi-cost algorithm of non-polynomial complexity that uses a full domination relation between paths. We then propose two mechanisms to prune the solution space in order to obtain polynomial complexity algorithms. In the first mechanism we define pseudo-domination relations …

    greece Repository record for Δρομολόγηση και αποδοτική ανάθεση χωρητικότητας σε ευρυζωνικά οπτικά δίκτυα (opens in a new tab)

  13. Goodness-of-Fit Statistics and Generalized Confidence Envelope

    … of the confidence envelope has exponential complexity. The high demand for computational power makes it infeasible in practice. We present a fast algorithm for computing the confidence envelope with a polynomial complexity for a family of global null statistics called the BJ-like statistic. …

    buffalo Repository record for Goodness-of-Fit Statistics and Generalized Confidence Envelope (opens in a new tab)

  14. Determine network survivability using heuristic models

    … the potential server hosts. However, due to the complexity of the network, the computation of the metric becomes very complex too. This thesis develops heuristic solutions of polynomial complexity to find the hosting server node. In doing so, it minimizes the time and computer power required.

    nps Repository record for Determine network survivability using heuristic models (opens in a new tab)

  15. Throughput optimization in MIMO networks

    … MIMO network scenarios that feasibility is of polynomial complexity. However, we conjecture that in general, this problem, which is a variation of Boolean Satisablility, is NP-Complete.

    gatech Repository record for Throughput optimization in MIMO networks (opens in a new tab)

  16. Flight gate assignment and proactive flight gate reassignment optimization for hub and spoke airline operations

    … for large-problem instances in which non-polynomial complexity becomes prohibitive. This formulation and heuristic application is demonstrated for the gating of scheduled flights of Continental Airlines at George W. Bush Intercontinental Airport in Houston (IAH). Reassignments of flights …

    ttu Repository record for Flight gate assignment and proactive flight gate reassignment optimization for hub and spoke airline operations (opens in a new tab)

  17. Graph Isomorphism Algorithms Based on Trees and Paths.

    Polynomially bounded algorithms are presented for testing isomorphism of two classes of graphs: the strongly regular graphs, which have been difficult for many previous isomorphism algorithms to process, and the compact graphs (graphs with diameter of 2 whose complements also have diameter of …

    uab Repository record for Graph Isomorphism Algorithms Based on Trees and Paths. (opens in a new tab)

  18. Scalable and Sparse Class Probability Estimation with Weighted Support Vector Machines

    … algorithm proposed by Wang et al. (2019) has a polynomial complexity in K (the number of classes), which is suboptimal. To address these issues, my Ph.D. research work is devoted to developing new ideas to improve existing wSVMs from three different perspectives. This thesis consists of three …

    arizona-thes Repository record for Scalable and Sparse Class Probability Estimation with Weighted Support Vector Machines (opens in a new tab)

Page 1 of 3