Sökning: "automated problem solving"
Visar resultat 1 - 5 av 32 uppsatser innehållade orden automated problem solving.
1. Diffusion-based Vocoding for Real-Time Text-To-Speech
Master-uppsats, Lunds universitet/Matematisk statistikSammanfattning : The emergence of machine learning based text-to-speech systems have made fully automated customer service voice calls, spoken personal assistants, and the creation of synthetic voices seem well within reach. However, there are still many technical challenges with creating such a system which can generate audio quickly and of high enough quality. LÄS MER
2. Självkörande bil
M1-uppsats, Högskolan i Borås/Akademin för textil, teknik och ekonomiSammanfattning : Göteborgs Tekniska College valde att starta en ny kurs våren 2018 inom Teknik specialisering. Kursen skulle inkludera ett större projekt där deltagarna får bygga en självkörande bil i en ”uppkopplad stadsmiljö” med målet att utveckla och tillämpa färdigheter inom programmering, elektronik och projektutförande. LÄS MER
3. Next generation rear axle assembly - A case study of Scania CV AB
Master-uppsats, Lunds universitet/ProduktionsekonomiSammanfattning : Title: Next generation rear axle assembly - A case study at Scania Authors: Richard Andrae & William Bergmark Background: Following the development of industry 4.0, new production technologies enabling more efficient assembly processes constantly evolve. LÄS MER
4. Concept development and design for the integration of autonomous mobile robots : A contribution towards fully automated line feeding
Master-uppsats, KTH/Skolan för industriell teknik och management (ITM)Sammanfattning : Automation is a key enabler of modern manufacturing. It can result in increased flexibility, safety, and reduced costs. Internal logistics processes have thus far been automated to a lower level compared to other processes in a manufacturing system. LÄS MER
5. Detecting quantum speedup for random walks with artificial neural networks
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Random walks on graphs are an essential base for crucial algorithms for solving problems, like the boolean satisfiability problem. A speedup of random walks could improve these algorithms. The quantum version of the random walk, quantum walk, is faster than random walks in specific cases, e.g. LÄS MER