Avancerad sökning

Visar resultat 1 - 5 av 131 avhandlingar som matchar ovanstående sökkriterier.

1. 1. Offline Task Scheduling in a Three-layer Edge-Cloud Architecture

   Författare :Ayeh Mahjoubi; Karl-Johan Grinnemo; Arunselvan Ramaswamy; Alessandro Papadopoulos; Karlstads universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; task offloading; task scheduling; edge computing; internet of things; optimization techniques; heuristics; meta-heuristics; Computer Science; Datavetenskap;

   Sammanfattning : Internet of Things (IoT) devices are increasingly being used everywhere, from the factory to the hospital to the house to the car. IoT devices typically have limited processing resources, so they must rely on cloud servers to accomplish their tasks. Thus, many obstacles need to be overcome while offloading tasks to the cloud. LÄS MER

3. 2. 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 :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

4. 3. Admissible Heuristics for Automated Planning

   Författare :Patrik Haslum; Patrick Doherty; Derek Long; Linköpings universitet; []
   Nyckelord :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

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

   Författare :Libertad Tansini; Chalmers tekniska högskola; []
   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

7. 5. 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 :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