Search for dissertations about: "perfect"

Showing result 6 - 10 of 400 swedish dissertations containing the word perfect.

  2. 6. Hardness of Constraint Satisfaction and Hypergraph Coloring : Constructions of Probabilistically Checkable Proofs with Perfect Completeness

    Author : Sangxia Huang; Johan Håstad; Rishi Saket; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Combinatorial optimization; approximation; inapproximability; hardness; probabilistically checkable proofs; pcp; perfect completeness; boolean constraint satisfaction problem; csp; graph coloring; hypergraph coloring; direct sum; superposition; label cover; Computer Science; Datalogi;

    Abstract : A Probabilistically Checkable Proof (PCP) of a mathematical statement is a proof written in a special manner that allows for efficient probabilistic verification. The celebrated PCP Theorem states that for every family of statements in NP, there is a probabilistic verification procedure that checks the validity of a PCP proof by reading only 3 bits from it. READ MORE

  4. 7. On Perfect Simulation of Markovian Queueing Networks with Blocking

    Author : Dan Mattsson; Göteborgs universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Markov chain; Monte Carlo methods; Propp-Wilson algorithm; perfect simulation; queueing theory; Jackson networks; birth and death processes; Jackson networks;

    Abstract : Perfect simulation of a class of Markovian queueing networks with finite buffers is examined in this monograph. The network processes defined are modelled by restricted multivariate birth and death processes with intensities depending on a random environment. The random environments are mainly a set of independent onoff processes. READ MORE

  5. 8. A study on mixed perfect codes

    Author : Olof Heden; Stockholms universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : .... READ MORE

  6. 9. Creating & Enabling the Useful Service Discovery Experience : The Perfect Recommendation Does Not Exist

    Author : Magnus Ingmarsson; Henrik Eriksson; Göran Falkman; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Ubiquitous Computing; Service Discovery; Ontologies; Common Sense; World Knowledge; Design; Architecture; Command and Control;

    Abstract : We are rapidly entering a world with an immense amount of services and devices available to humans and machines. This is a promising future, however there are at least two major challenges for using these services and devices: (1) they have to be found and (2) after being found, they have to be selected amongst. READ MORE

  7. 10. Perfect simulation of some spatial point processes

    Author : Kajsa Larson; Olle Häggström; Chalmers University of Technology and Göteborg University Department of Mathematical Statistics; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Perfect simulering; coupling from the past; Markov shain Monte Carlo; point process; Widom-Rowlinson model; Mathematical statistics; Matematisk statistik; Mathematical Statistics; matematisk statistik;

    Abstract : Coupling from the past (CFTP) algorithms are presented that generate perfectly distributed samples from the multi-type Widom--Rowlinson (W--R) model and some generalizations of it. The classical W--R model is a point process in the plane or the  space consisting of points of several different types. READ MORE