Search for dissertations about: "Decision Algebra"
Showing result 1 - 5 of 9 swedish dissertations containing the words Decision Algebra.
-
1. Decision Algebra : A General Approach to Learning and Using Classifiers
Abstract : 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. READ MORE
-
2. Decisions : Algebra and Implementation
Abstract : 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. READ MORE
-
3. Simplicial Complexes of Graphs
Abstract : 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. READ MORE
-
4. Formalizing Refinements and Constructive Algebra in Type Theory
Abstract : 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. READ MORE
-
5. Symbolic Methods and Tools for Discrete Event Dynamic Systems
Abstract : 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. READ MORE