Sökning: "parallel algorithm"

Visar resultat 1 - 5 av 202 avhandlingar innehållade orden parallel algorithm.

  1. 1. Automatic parallel parking : park assist systems for passenger vehicles

    Detta är en avhandling från Linköping : Linköpings universitet

    Författare :Pär Degerman; [2007]

    Sammanfattning : This thesis discusses how the problem of parking a passenger car can be solved. There ane numerous obstacles when creating a fully or semi automated system for assisting the parking maneuver. The obstacles range from unobtrusive Man Machine Interface issues to robust algorithms for finding features in sensor data. LÄS MER

  2. 2. Algorithms for Molecular Dynamics Simulations

    Detta är en avhandling från Stockholm : Institutionen för fysikalisk kemi, oorganisk kemi och strukturkemi

    Författare :Fredrik Hedman; Aatto Laaksonen; Tom Darden; [2006]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; molecular dynamics; MD; first principles molecular dynamics; quantum mechanics; liquid water; parallel algorithm; data parallel; MPI; Coulombic interaction; Ewald summation; nonuniform fast Fourier transform; FFT; FFTW; NFFT; ENUF; NATURAL SCIENCES Chemistry Physical chemistry; NATURVETENSKAP Kemi Fysikalisk kemi;

    Sammanfattning : Methods for performing large-scale parallel Molecular Dynamics(MD) simulations are investigated. A perspective on the field of parallel MD simulations is given. Hardware and software aspects are characterized and the interplay between the two is briefly discussed. LÄS MER

  3. 3. Efficient Parallel Algorithms for Combinatorial Problems

    Detta är en avhandling från Department of Computer Science, Lund University

    Författare :Oscar Garrido Gómez; [1996]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Matematik; Mathematics; Data- och systemvetenskap; computer technology; Systems engineering; matchings.; independent sets; graphs; parallel algorithms;

    Sammanfattning : This thesis is concerned with the design of efficient parallel algorithms for some optimization graph problems. A subset S of vertices or edges in a graph G is said to be maximum with respect to a property if, among all the subsets of G having this property, S is one having the largest cardinality. LÄS MER

  4. 4. An implementation of a parallel rational Krylov algorithm

    Detta är en avhandling från Department of Computer Science, Lund University

    Författare :Daniel Skoogh; [1996]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; paralell; shift; sparse; Krylov; Arnoldi; invert; eigenvalues; eigenvectors; rational;

    Sammanfattning : .... LÄS MER

  5. 5. Phase transitions in novel superfluids and systems with correlated disorder

    Detta är en avhandling från Stockholm : KTH Royal Institute of Technology

    Författare :Hannes Meier; Mats Wallin; Asle Sudbø; [2015]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; condensed matter physics; phase transitions; critical phenomena; spin models; quantum phase transitions; quantum fluids; superfluidity; superconductivity; disordered systems; Bose glass; dirty bosons; vortex pinning; statistical mechanics; Monte Carlo simulation; Wolff algorithm; classical worm algorithm; Wang-Landau algorithm; Physics; Fysik;

    Sammanfattning : Condensed matter systems undergoing phase transitions rarely allow exact solutions. The presence of disorder renders the situation  even worse but collective Monte Carlo methods and parallel algorithms allow numerical descriptions. LÄS MER