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 5 of 5 for “"Powerset"”.

  1. Applications of Powerset Operators, Especially to Matroids

    … </p><p>We expand on this relation to define a powerset operator: \((\phantom{S})^*\). Given \(\mathcal{S} \subseteq \mathcal{P}(E)\), we denote \(\mathcal{S}^*\) to be the minimal sets of \(\{X \subseteq E \colon X \text{ is nonempty, } |X \cap A| \neq 1 \text{ for each } A \in \mathcal{S}\}\). …

    syracuse-diss Repository record for Applications of Powerset Operators, Especially to Matroids (opens in a new tab)

  2. Parasite communities and their identification in wild and domestic herbivores in Iceland

    … relevance (BR), classifier chain (CC) and label powerset (LP) frameworks to calibrate NIRS and MIRS spectra to nemabiome results. All models were able to identify parasite species from frozen samples, however label powerset (LP) framework offered the best model performance results overall, …

    ag-u-iceland Repository record for Parasite communities and their identification in wild and domestic herbivores in Iceland (opens in a new tab)

  3. Static analysis for detecting and avoiding floating-point run-time errors in logic programs

    … the polyhedra domain as well as into the finite powerset of polyhedra domain. Moreover, this thesis aims at presenting a forward and a backward analysis for the detection and inference of floating-point errors such as overflow and division by zero. These techniques are based on abstract …

    whiterose Repository record for Static analysis for detecting and avoiding floating-point run-time errors in logic programs (opens in a new tab)

  4. Boolean ultrapowers

    … complete Boolean algebra replaces the customary powerset Boolean algebra. B. Koppelberg and S. Koppelberg [1976] show that the class of ordinary ultrapowers is properly contained in the class of Boolean ultrapowers thereby justifying the development of a theory for Boolean ultrapowers. This …

    cape-town Repository record for Boolean ultrapowers (opens in a new tab)

  5. Probabilistic completion of nondeterministic models

    … requires the composition of the finite nonempty powerset functor P*fin , which constructs free models of nondeterministic choice over an arbitrary set X, and the &or;-stable functor Stblfin, which constructs free models of mixed choice over an arbitrary semilattice (S, &or;). This alternative …

    ottawa-retro Repository record for Probabilistic completion of nondeterministic models (opens in a new tab)