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 3 of 3 for “"Non-Deterministic Polynomial"”.
-
Standard and Non-standard reasoning in Description Logics
… domain, makes reasoning intractable. (2) Non-standard inferences for knowledge maintenance: non-standard inferences, such as matching, can support domain experts in maintaining DL knowledge bases in a structured and well-defined way. In order to extend their availability and promote their …
-
From Electron Glasses to Quantum Machine Learning: A Study in Quadratic Unconstrained Binary Optimization
… and industrial applications as many interesting non-deterministic polynomial (NP)- hard problems can be mapped to them. QUBO is a subset of combinatorial optimization in which one seeks the global minimum of an objective function within a finite by occasionally towering set of possible …
-
Linear and nonlinear semidefinite relaxations of some NP-hard problems
… introduces and studies several novel linear and nonlinear semidefinite relaxation models for some NP-hard problems. We first study the semidefinite relaxation of Quadratic Assignment Problem (QAP) based on matrix splitting. We characterize an optimal subset of all valid matrix splittings and …