Sökning: "NP"

Visar resultat 1 - 5 av 229 avhandlingar innehållade ordet NP.

  1. 1. Noun Phrases in British Travel Texts : A Corpus-Based Study

    Författare :Tore Nilsson; Uppsala universitet; []
    Nyckelord :HUMANIORA; HUMANITIES; English language; corpus linguistics; syntactic variation; noun phrase NP ; premodification; postmodification; simple; complex; NP head; NP function; Engelska; English language; Engelska språket; English; engelska;

    Sammanfattning : This study is a corpus-based investigation of the structure and variation of noun phrases in three types of British texts on tourism and travel. Based on their publishing formats, the corpus texts are divided into three Text categories: tourist brochures, newspaper feature articles dealing with travel and tourism, and travel guides. LÄS MER

  3. 2. Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction

    Författare :Cenny Wenner; Johan Håstad; Viggo Kann; Irit Dinur; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Combinatorial Optimization; Complexity Theory; Approximation; Approximability; Inapproximability; Computational Hardness; NP; Optimization; Constraint Satisfaction; Kombinatorisk optimering; Komplexitetsteori; Beräkningsteori; Approximation; Approximerbarhet; Beräkningssvårighet; NP; Optimering; Vilkorssatisfiering; Vilkorsuppfyllning; Vilkorstillfredställand; datalogi; Computer Science;

    Sammanfattning : Combinatorial optimization include such tasks as finding the quickest route to work, scheduling jobs to specialists, and placing bus stops so as to minimize commuter times. We consider problems where one is given a collection of constraints with the objective of finding an assignment satisfying as many constraints as possible, also known as Constraint Satisfaction Problems (CSPs). LÄS MER

  4. 3. 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

  5. 4. Studies of surface complexation of H⁺, NpO₂⁺, Co²⁺, Th⁴⁺ onto TiO₂ and H⁺, UO₂²⁺ onto alumina

    Författare :Anna-Maria Jakobsson; Chalmers tekniska högskola; []
    Nyckelord :alumina; TiO2; Co; surface complexation; sorption; Np; U; Th;

    Sammanfattning : .... LÄS MER

  7. 5. Modelling of sorption mechanism

    Författare :Karl Vannerberg; Chalmers tekniska högskola; []
    Nyckelord :sorption; bonding energy; Np; Na; Pm; Co; hydrolysis;

    Sammanfattning : .... LÄS MER