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 94 for “"Normal Form"”.

  1. A non-normal form database interface

    Typescript (photocopy).

    ksu-retro Repository record for A non-normal form database interface (opens in a new tab)

  2. Formulas of first-order logic in distributive normal form

    It was shown by Jaakko Hintikka that every formula of first-order logic can be written as a disjunction of formulas called constituents. Such a disjunction is called a distributive normal form of the formula. It is a generalization of the disjunctive normal form for propositional logic. However, …

    cape-town Repository record for Formulas of first-order logic in distributive normal form (opens in a new tab)

  3. Strategizing against online learners in normal form repeated games

    With the advent of machine learning and AI, learning algorithms are becoming more and more prevalent in online learning settings, where sequential decision-making is required. In such settings, the decisions of each agent can affect the utilities (or losses) of the other agents, as well as …

    mit Repository record for Strategizing against online learners in normal form repeated games (opens in a new tab)

  4. On the Learnability of Disjunctive Normal Form Formulas and Decision Trees

    The learnability of disjunctive normal form formulas and decision trees is investigated. Polynomial time algorithms are given, and nonlearnability results are obtained, for restricted versions of these general learning problems.

    uiuc Repository record for On the Learnability of Disjunctive Normal Form Formulas and Decision Trees (opens in a new tab)

  5. A Normal Form Theorem for Higman-Neumann-Neumann Extensions of Semigroups

    Made available in DSpace on 2014-12-14T13:09:39Z (GMT). No. of bitstreams: 1 7913498.pdf: 3131138 bytes, checksum: 201750952fa10669ba471496989479f4 (MD5) Previous issue date: 1978

    uiuc Repository record for A Normal Form Theorem for Higman-Neumann-Neumann Extensions of Semigroups (opens in a new tab)

  6. NORMAL FORM METHODS FOR SOME NON LINEAR HAMILTONIAN PDES IN HIGHER DIMENSION

    … and geometric framework. Proofs are based on normal form methods.

    milano Repository record for NORMAL FORM METHODS FOR SOME NON LINEAR HAMILTONIAN PDES IN HIGHER DIMENSION (opens in a new tab)

  7. Feature-Based Choice and Similarity Perception in Normal-Form Games: An Experimental Research

    … my thesis, I investigate how strategic behavior forms in the mind of the subjects and how is it possible to influence or manipulate it, without proposing modifications of the utility function, but referring to possible logical and psychological processes. I start from the assumption that agents …

    trento Repository record for Feature-Based Choice and Similarity Perception in Normal-Form Games: An Experimental Research (opens in a new tab)

  8. Método da forma normal e suas aplicações em oscilações e estabilidade

    … case of a bifurcation. This method is called "Normal Form Method" (NFM) and it is based in the Normal Form Theory and Center Manifold Theory. We derive recursive normalization formulae for the study of some important cases. We also present the results achieved from the solution of some example …

    brazil-uerj Repository record for Método da forma normal e suas aplicações em oscilações e estabilidade (opens in a new tab)

  9. Isomorphism classes of almost completely decomposable groups

    … group with a primary regulator quotient. A uniform group is a rigid local group with a homocyclic regulator quotient. In Chapter 3 a weakening of isomorphism, called type-isomorphism, appears. It is shown that type-isomorphism agrees with Lady's near-isomorphism. By the Main Decomposition …

    wurz-thes Repository record for Isomorphism classes of almost completely decomposable groups (opens in a new tab)

  10. Homotopy algorithms for the H² and the combined H²/H<sup>∞</sup> model order reduction problems

    … problems homotopy algorithms based on several formulations input normal form; Ly, Bryson, and Cannon's 2 X 2 block parametrization; a new nonminimal parametrization are developed and compared here. For the H² optimal model order reduction problem, these numerical algorithms are also compared …

    vt Repository record for Homotopy algorithms for the H² and the combined H²/H<sup>∞</sup> model order reduction problems (opens in a new tab)

  11. Tri-State Boolean Satisfiability with Commit: An Efficient Partial Solution Using Hyperlogic

    … the semantics of the classic 3 Conjunctive Normal Form Problem in order to develop a polynomial time algorithm for a simplified normal form - avoiding the need to examine all combinatoric limitations. In particular, we abandoned 3 CNF and used an unstructured left to right associativity. We …

    usm Repository record for Tri-State Boolean Satisfiability with Commit: An Efficient Partial Solution Using Hyperlogic (opens in a new tab)

  12. Global normal forms and global properties in function spaces for second order Shubin type operators

    We investigate the reduction to global normal forms of second order Shubin(or G) type differential operators P(x;D) in functional spaces on Rn. We describe the isomorphism properties of normal form transformations, introduced by L. Hormander for the study of affine symplectic transformations acting …

    cagliari Repository record for Global normal forms and global properties in function spaces for second order Shubin type operators (opens in a new tab)

  13. Perfect recall and the informational contents of strategies in extensive games

    … dissertation consists of five chapters on the informational contents of strategies and the role of the perfect recall condition for information partitions in extensive games. The first, introductory, chapter gives basic definitions of extensive games and some results known in the game theory …

    vt Repository record for Perfect recall and the informational contents of strategies in extensive games (opens in a new tab)

  14. Efficient algorithms in Coxeter groups of large type

    … for the group to be hyperbolic, and we give a normal form for large-type Coxeter groups that is a regular bicombing, thus establishing that all such groups are biautomatic.

    uiuc Repository record for Efficient algorithms in Coxeter groups of large type (opens in a new tab)

  15. Sequential Decision Making For Choice Functions On Gambles

    … it is less easy. One possibility, called a normal form solution, is to list all available strategies (specifications of acts to take in all eventualities). This reduces the problem to a single choice between gambles. We primarily investigate three appealing behaviours of these solutions. The …

    durham Repository record for Sequential Decision Making For Choice Functions On Gambles (opens in a new tab)

  16. Elliptic Curves Over Finite Fields

    … theory of algebraic curves and the Weierstrass Normal Form of a cubic curve is derived. In Chapter 3 we define derivations on arbitrary polynomial rings, and prove the group law for elliptic curves. Chapter 4 discusses elliptic curves over finite fields and proves some results on counting points.

    maynooth Repository record for Elliptic Curves Over Finite Fields (opens in a new tab)

  17. Functional Encryption as Mediated Obfuscation

    … feasibility result for obfuscating conjunctive normal form and disjunctive normal form formulae (under a weaker “semantic” notion of security). Finally, we use mediated obfuscation to illustrate a connection between worst-case and average-case static obfuscation. In short, an average-case …

    montana-tech Repository record for Functional Encryption as Mediated Obfuscation (opens in a new tab)

  18. Functional Encryption as Mediated Obfuscation

    … feasibility result for obfuscating conjunctive normal form and disjunctive normal form formulae (under a weaker “semantic” notion of security). Finally, we use mediated obfuscation to illustrate a connection between worst-case and average-case static obfuscation. In short, an average-case …

    montana Repository record for Functional Encryption as Mediated Obfuscation (opens in a new tab)

  19. Modelling prion-induced neurodegeneration in PrP transgenic Drosophila

    … diseases are caused by the occurrence of an abnormally-folded form of PrP (PrPSc) protein that arises either from the environment as an acquired disease, from mutation in the PrP-coding gene as a genetic disease or sporadically from causes unknown. The PrPSc then recruits PrPC, the normal form

    cambridge Repository record for Modelling prion-induced neurodegeneration in PrP transgenic Drosophila (opens in a new tab)

  20. Analytical and Computational Tools for the Study of Grazing Bifurcations of Periodic Orbits and Invariant Tori

    … by impacts. Here, the study emphasizes the formulation of conditions for the persistence of a steady state motion in the immediate vicinity of periodic and quasiperiodic grazing trajectories in an impacting mechanical system. A local analysis based on the discontinuity-mapping approach is …

    vt Repository record for Analytical and Computational Tools for the Study of Grazing Bifurcations of Periodic Orbits and Invariant Tori (opens in a new tab)

Page 1 of 5