Sökning: "Range Search"

Visar resultat 16 - 20 av 207 avhandlingar innehållade orden Range Search.

1. 16. Patterns and procedural content generation in digital games : automatic level generation for digital games using game design patterns

   Författare :Steve Dahlskog; Pieter Spronck; Malmö högskola; []
   Nyckelord :Procedural Content Generation; Search-based; Genetic Algorithms; Digital Games; Design Patterns;

   Sammanfattning : The development of content in digital games, such as game worlds, quests, levels, 3D-models, and textures, is costly and time consuming. To address this, different approaches to automate the process of creating game content, often referred to as procedural content generation (PCG), has been suggested. LÄS MER

3. 17. Convergence Analysis and Design of Multiple Concatenated Codes

   Författare :Fredrik Brännström; Chalmers tekniska högskola; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; extrinsic information transfer EXIT function; convergence analysis; Multiple concatenated codes; code search; scheduling; parameter estimation; iterative decoding; EXIT chart; puncturing;

   Sammanfattning : The objective of this thesis is to develop a methodology for designing efficient multiple concatenated coding schemes, consisting of two or more constituent codes, concatenated in serial or in parallel. Extrinsic information transfer (EXIT) analysis is found to be a suitable and versatile analysis tool for such codes and thus, the design methodology is based almost entirely on this technique. LÄS MER

4. 18. Voluntary Information Sharing, Retail Pricing and Firm Performance

   Författare :Charlie Lindgren; Siril Yella; Niklas Rudholm; Johan Håkansson; Christian Sandström; Högskolan Dalarna; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Voluntary information sharing; online retailing; e-commerce; price comparison websites; CSR; consumer search;

   Sammanfattning : Online information sharing by firms has created an unprecedented amount of data to analyze by researchers. While conclusions from research should be drawn with basis in sound theory, there has also emerged a need to supplement these theoretical considerations with advanced data collection, storage and analysis as well as reporting to decisionmakers. LÄS MER

5. 19. Convergence Analysis and Improvements for Projection Algorithms and Splitting Methods

   Författare :Mattias Fält; Institutionen för reglerteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; First-order methods; Convex Optimization; Nonsmooth Optimization; Large-scale Optimization; Iterative Methods; Douglas-Rachford splitting; Line Search;

   Sammanfattning : Non-smooth convex optimization problems occur in all fields of engineering. A common approach to solving this class of problems is proximal algorithms, or splitting methods. These first-order optimization algorithms are often simple, well suited to solve large-scale problems and have a low computational cost per iteration. LÄS MER

7. 20. A search for ultra-high energy neutrinos with AMANDA-II

   Författare :Christin Wiedemann; Stephan Hundertmark; Lee Thompson; Stockholms universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Neutrinos; Cosmic rays; Ultra-high energy; AMANDA; IceCube; Physics; Fysik; Physics; fysik;

   Sammanfattning : High-energy neutrinos are capable of carrying information over vast distances, and neutrino telescopes such as AMANDA-II provide the means to probe deep inside the violent and energetic interior of the universe. AMANDA-II is located in the glacial ice at South Pole in Antarctica and is optimised to detect Cherenkov emission from neutrino-induced muon tracks with energies above 100 GeV. LÄS MER