Sökning: "Heuristics"

Visar resultat 1 - 5 av 124 avhandlingar innehållade ordet Heuristics.

1. 1. He[d]uristics - Heuristics for designing object oriented examples for novices

   Författare :Marie Nordström; Jürgen Börstler; Kathryn Sanders; Umeå universitet; []
   Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Examples; Object orientation; heuristics; Computer science; Datavetenskap; computer and systems sciences; data- och systemvetenskap;

   Sammanfattning : The use of examples is known to be important in learning, they should be “exemplary” and function as role-models. Teaching and learning problem solving and programming in the object oriented paradigm is recognised as difficult. Object orientation is designed to handle complexity and large systems, and not with education in focus. LÄS MER

3. 2. Admissible Heuristics for Automated Planning

   Författare :Patrik Haslum; Patrick Doherty; Derek Long; Linköpings universitet; []
   Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; AI planning; optimal planning; temporal planning; heuristic search; Computer science; Datalogi;

   Sammanfattning : The problem of domain-independent automated planning has been a topic of research in Artificial Intelligence since the very beginnings of the field. Due to the desire not to rely on vast quantities of problem specific knowledge, the most widely adopted approach to automated planning is search. LÄS MER

4. 3. Probabilistic and Experimental Analysis of Heuristic Algorithms for the Multiple-Depot Vehicle-Routing Problem

   Författare :Libertad Tansini; Chalmers University of Technology; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; probabilistic analysis; Multi-Depot Vehicle-Routing problem; heuristics; Time-Windows;

   Sammanfattning : The aim of this thesis is to analyze different heuristic algorithms for solving the Multi-Depot Vehicle-Routing problem (MDVRP) with k depots and n points to be serviced (customers). The objective is to produce a set of service routes which minimizes the total distance traveled. Heuristic approaches are essential since the problem is NP-hard. LÄS MER

5. 4. Optimization of Just-in-Time Sequencing Problems and Supply Chain Logistics

   Författare :Gyan Thapa; Sergei Silvestrov; Anatoliy Malyarenko; George Fodor; Mälardalens högskola; []
   Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Just-in-time; JIT sequencing; apportionment; product rate variation; output rate variation; algorithms; heuristics; supply chain; logistics; queueing; non-linear integer programming; Mathematics Applied Mathematics; matematik tillämpad matematik;

   Sammanfattning : This dissertation presents a comprehensive and comparative progress in sequencing approaches of mixed-model just-in-time (JIT) sequencing problem together with discrete apportioment problem (DAP). The goal of JIT sequencing problem (JITSP) is to keep the rate of usage of parts as constant as possible along the assembly lines, and the goal of DAP is to divide a given integer number of delegates proportionally among the states or the parties according to their population or votes. LÄS MER

7. 5. Kroppar under träd – en miljö för konstnärlig forskning

   Författare :Henric Benesch; Göteborgs universitet; Göteborgs universitet; Gothenburg University; []
   Nyckelord :Artistic Research; Architecture; Change; Doxa; Environment; Heuristics; Space; Poetics;

   Sammanfattning : This dissertation in the field of artistic research is an articulation, in words and images, on the experience of working with a notional environment for artistic research. It is not a reflection on or a description of the process which the work has involved, but above all an articulation, characterisation and development, in words and images, of the conceptual and pictorial world constituted during, through and in the course of the actual work on an environment for artistic research in Vasaparken, Göteborg. LÄS MER