Sökning: "algorithm construction"

Visar resultat 1 - 5 av 116 avhandlingar innehållade orden algorithm construction.

1. 1. Extensible Compiler Construction

   Författare :Torbjörn Ekman; Institutionen för datavetenskap; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; numerical analysis; Computer science; attribute grammars; extensible compilers; context-sensitive transformations; declarative object-oriented programming; kontroll; system; numerisk analys; Datalogi; control; systems;

   Sammanfattning : Processing of programs is a core area in computer science. A compiler that translates source text to machine language is the most well-known kind of tool in this area, but there are numerous other kinds of related applications: source-to-source translators, refactoring tools, reengineering tools, metrics tools, consistency checkers, etc. LÄS MER

3. 2. Reinforcement in Biology : Stochastic models of group formation and network construction

   Författare :Qi Ma; David Sumpter; Edward Codling; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; reinforcement in biology; merge and split model; preferential attachment; reinforced random walk; network construction; shortest path problem; transport networks; ant algorithm; slime mould; physarum polycephalum; speed-accuracy tradeoff.; Mathematics with specialization in Applied Mathematics; Matematik med inriktning mot tillämpad matematik;

   Sammanfattning : Empirical studies show that similar patterns emerge from a large number of different biological systems. For example, the group size distributions of several fish species and house sparrows all follow power law distributions with an exponential truncation. LÄS MER

4. 3. Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications

   Författare :Ola Angelsmark; Peter Jonsson; Brahim Hnich; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint satisfaction; CSP; graph problems; algorithm construction; computational complexity; microstructures; graph colouring; decision problems; optimisation problems; quantum computing; molecular computing; Computer science; Datavetenskap;

   Sammanfattning : In this thesis, we will discuss the construction of algorithms for solving Constraint Satisfaction Problems (CSPs), and describe two new ways of approaching them. Both approaches are based on the idea that it is sometimes faster to solve a large number of restricted problems than a single, large, problem. LÄS MER

5. 4. Brownian Dynamics Simulations of Macromolecules : Algorithm Development and Polymers under Confinement

   Författare :Tobias Carlsson; Christer Elvingson; Wim Briels; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

   Sammanfattning : In this thesis I have used computer simulations to study the structure and dynamics of grafted polymers during confinement. These systems are of importance for understanding e.g. colloidal stability and surface coatings. LÄS MER

7. 5. Optimization-Based Motion Planning and Model Predictive Control for Autonomous Driving : With Experimental Evaluation on a Heavy-Duty Construction Truck

   Författare :Pedro F. Lima; Bo Wahlberg; Paolo Falcone; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Automatic Control; Autonomous Driving; Model Predictive Control; Motion Planning; Optimization; Electrical Engineering; Elektro- och systemteknik;

   Sammanfattning : This thesis addresses smooth motion planning and path following control of autonomous large and heavy industrial vehicles, such as trucks and buses, using optimization-based techniques. Autonomous driving is a rapidly expanding technology that promises to play an important role in future society, since it aims at more energy efficient, more convenient, and safer transport systems. LÄS MER