Sökning: "system complexity"

Visar resultat 1 - 5 av 1563 avhandlingar innehållade orden system complexity.

1. 1. Space in Proof Complexity

   Författare :Marc Vinyals; Jakob Nordström; Yehudayoff Amir; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; proof complexity; resolution; polynomial calculus; cutting planes; space complexity; computational complexity; pebble games; communication complexity; CDCL; Computer Science; Datalogi;

   Sammanfattning : ropositional proof complexity is the study of the resources that are needed to prove formulas in propositional logic. In this thesis we are concerned with the size and space of proofs, and in particular with the latter.Different approaches to reasoning are captured by corresponding proof systems. LÄS MER

3. 2. Constructing Evolutionary Trees - Algorithms and Complexity

   Författare :Anna Östlin; Institutionen för datavetenskap; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Maximum homeomorphic subtrees; Consensus trees; Experiment model; Evolutionary trees; Complexity; Computational biology; Algorithms; Data structures; numerical analysis; systems; control; Datalogi; numerisk analys; system; kontroll; Biology; Biologi;

   Sammanfattning : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. LÄS MER

4. 3. On Some Combinatorial Optimization Problems : Algorithms and Complexity

   Författare :Hannes Uppman; Peter Jonsson; Christer Bäckström; Ulf Nilsson; Stanislav Živný; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computational complexity; optimization; constraint satisfaction problem;

   Sammanfattning : This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems.A constraint language consists of a domain and a set of relations on the domain. For each such language there is a constraint satisfaction problem (CSP). LÄS MER

5. 4. ForSyDe-Atom: Design of Heterogeneous Embedded Systems : Taming Complexity with Layers, Atoms and Patterns

   Författare :George Ungureanu; Ingo Sander; Reinhard von Hanxleden; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; system design languages; modeling; simulation; synthesis; embedded systems; cyber-physical systems; domain specific languages; systemdesignspråk; modellering; simulering; syntes; inbyggda system; cyberfysiska system; domänspecifika språk; Informations- och kommunikationsteknik; Information and Communication Technology;

   Sammanfattning : The design of embedded systems is inherently complex for two main reasons. Firstly, it entails the combined knowledge and results from a vast set of mature, well-established, yet separate disciplines, such as electrical engineering, computer science, mechanical engineering, etc. LÄS MER

7. 5. Complexity Dichotomies for CSP-related Problems

   Författare :Gustav Nordh; Peter Jonsson; Andrei Krokhin; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Complexity; Constraint Satisfaction Problem; System of Equations; Nonmonotonic Logic; Circumscription; Abduction; Isomorphism; Computer science; Datavetenskap;

   Sammanfattning : Ladner’s theorem states that if P ≠ NP, then there are problems in NP that are neither in P nor NP-complete. Csp(Γ) is a class of problems containing many well-studied combinatorial problems in NP. LÄS MER