Sökning: "cutting planes"

Visar resultat 1 - 5 av 8 avhandlingar innehållade orden cutting planes.

  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. Fracture behaviour and related microstructures of tool steels parted-off at high rates of strain

    Författare :Kristina Ryttberg; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; high-velocity parting-off; adiabatic cutting; high strain-rate deformation; TEM; steel; adiabatic shear band;

    Sammanfattning : Increasing steel prices and environmental aspects have put forward the demand to reduce material consumption in manufacturing industry and near-net-shape manufacturing techniques have thus become increasingly important. High-velocity parting-off, or adiabatic cutting, has shown to result in very low material waste as well as narrow dimensional tolerances of parted-off samples. LÄS MER

  4. 3. Lower Bounds and Trade-offs in Proof Complexity

    Författare :Susanna F. de Rezende; Jakob Nordström; Amit Chakrabarti; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Proof complexity; trade-offs; lower bounds; size; length; space; Computer Science; Datalogi;

    Sammanfattning : Propositional proof complexity is a field in theoretical computer science that analyses the resources needed to prove statements. In this thesis, we are concerned about the length of proofs and trade-offs between different resources, such as length and space. LÄS MER

  5. 4. Integration of Constraint Programming and Integer Programming for Combinatorial Optimization

    Författare :Greger Ottosson; Mats Carlsson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datalogi; Datalogi; Computing Science;

    Sammanfattning : The last several years have seen an increasing interest in combining the models and methods of optimization with those of constraint programming. Integration of the two was initially impeded by their different cultural origins, one having developed largely in the operations research community and the other in the computer science and artificial intelligence communities. LÄS MER

  7. 5. Sputtering and Characterization of Complex Multi-element Coatings

    Författare :Erik Särhammar; Tomas Nyberg; Ulf Jansson; Urban Wiklund; Gustaf Sjöblom; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; thin film; coating; magnetron sputtering; modelling; tribofilm; tungsten disulphide;

    Sammanfattning : The thin film technology is of great importance in modern society and is a key technology in wide spread applications from electronics and solar cells to hard protective coatings on cutting tools and diffusion barriers in food packaging. This thesis deals with various aspects of thin film processing and the aim of the work is twofold; firstly, to obtain a fundamental understanding of the sputter deposition and the reactive sputter deposition processes, and secondly, to evaluate sputter deposition of specific material systems with low friction properties and to improve their performance. LÄS MER