Sökning: "Hardness"

Visar resultat 26 - 30 av 427 avhandlingar innehållade ordet Hardness.

  1. 26. Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction

    Författare :Cenny Wenner; Johan Håstad; Irit Dinur; Numerical Analysis and Computer Science (NADA) Faculty of Science Stockholm University; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Optimization; NP; Approximation; Approximability; Inapproximability; Constraint Satisfaction; CSP; Boolean Analysis; Satisfiability; SAT; Acyclic Subgraph; Betweenness; Unique Games; Computer Science; Datalogi;

    Sammanfattning : Problem solving is an integral aspect of modern society and includes such tasks as picking the fastest route to work, optimizing a production line, scheduling computer tasks, placing new bus stops, or picking a meal from available ingredients.We study the hardness of solving Constraint Satisfaction Problems (CSPs). LÄS MER

  3. 27. Impact of Ionizing Radiation on 4H-SiC Devices

    Författare :Muhammad Usman; Anders Hallén; Einar Örn Sveinbjörnsson; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Silicon carbide; ionizing radiation; bipolar junction transistors; reliability; surface passivation; high-k dielectrics; MIS; radiation hardness;

    Sammanfattning : Electronic components, based on current semiconductor technologies and operating in radiation rich environments, suffer degradation of their performance as a result of radiation exposure. Silicon carbide (SiC) provides an alternate solution as a radiation hard material, because of its wide bandgap and higher atomic displacement energies, for devices intended for radiation environment applications. LÄS MER

  4. 28. Topics in Distributed Algorithms: On Wireless Networks, Distributed Storage and Streaming

    Författare :Thomas Petig; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Message Passing; Wireless Networks; Time Division Multiple Access; Shared Memory; Fault-Tolerance; Streaming; NP-Hardness; Distributed Algorithm; Optimisation; TDMA;

    Sammanfattning : Distributed algorithms are executed on a set of computational instances. Werefer to these instances as nodes. Nodes are runningconcurrently and are independent from each other. Furthermore, they have their own instructions and information. LÄS MER

  5. 29. Exact Algorithms for Exact Satisfiability Problems

    Författare :Vilhelm Dahllöf; Peter Jonsson; Fedor Fomin; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NP-hardness; exact algorithms; satisfiability; exact satisfiability; Computer science; Datalogi;

    Sammanfattning : This thesis presents exact means to solve a family of NP-hard problems. Starting with the well-studied Exact Satisfiability problem (XSAT) parents, siblings and daughters are derived and studied, each with interesting practical and theoretical properties. LÄS MER

  7. 30. Indentation effects in plastic zones

    Författare :Cecilia Eriksson; KTH; []
    Nyckelord :Hardness testing; Mechanical properties; Residual stress; Residual strain; Microindentation; Nanoindentation; Secondary indentation; Micro cracking; Strain Hardening; Pressure hardening; Pressure Sensitivity; AMF; FEM; Brittle materials;

    Sammanfattning : .... LÄS MER