Sökning: "Decision Algebra"

Visar resultat 1 - 5 av 9 avhandlingar innehållade orden Decision Algebra.

  1. 1. Decision Algebra : A General Approach to Learning and Using Classifiers

    Författare :Antonina Danylenko; Welf Löwe; Jonas Lundberg; Uwe Assmann; Linnéuniversitetet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; classification; decision model; classifier; Decision Algebra; decision function; Computer Science; Datavetenskap;

    Sammanfattning : Processing decision information is a vital part of Computer Science fields in which pattern recognition problems arise. Decision information can be generalized as alternative decisions (or classes), attributes and attribute values, which are the basis for classification. LÄS MER

  3. 2. Decisions : Algebra and Implementation

    Författare :Antonina Danylenko; Welf Löwe; Jonas Lundberg; Wolf Zimmermann; Linnéuniversitetet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Classification; decision algebra; decision function; decision information; learning; Computer Science; Datavetenskap;

    Sammanfattning : Processing decision information is a constitutive part in a number of applicationsin Computer Science fields. In general, decision information can be used to deduce the relationship between a certain context and a certain decision. Decision information is represented by a decision model that captures this information. LÄS MER

  4. 3. Simplicial Complexes of Graphs

    Författare :Jakob Jonsson; Anders Björner; John Shareshian; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Algebra and geometry; simplicial complex; monotone graph property; discrete Morse theory; simplicial homology; homotopy type; connectivity degree; Cohen-Macaulay complex; Euler characteristic; decision tree; Algebra och geometri; Algebra and geometry; Algebra och geometri;

    Sammanfattning : Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simplicial complex consisting of subsets of E. In particular, we may interpret such a complex as a family of subgraphs of G. LÄS MER

  5. 4. Formalizing Refinements and Constructive Algebra in Type Theory

    Författare :Anders Mörtberg; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Formalization of mathematics; refinements; constructive algebra; type theory; Coq; SSReflect;

    Sammanfattning : The extensive use of computers in mathematics and engineering has led to an increased demand for reliability in the implementation of algorithms in computer algebra systems. One way to increase the reliability is to formally verify that the implementations satisfy the mathematical theorems stating their specification. LÄS MER

  7. 5. Symbolic Methods and Tools for Discrete Event Dynamic Systems

    Författare :Johan Gunnarsson; Lennart Ljung; Linköpings universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Decision diagrams; Polynomial relational representation; Landing gear controller;

    Sammanfattning : The interest in Discrete Event Dynamic Systems (DEDS) has increased during the last years, due to the lack of methods and tools that are capable of handling the complexity of problems and tasks present in industry today. In this thesis we will consider a framework based on relations over finite domains. LÄS MER