Einloggen

Thematische Bibliographien / Shor Algorithm / Dissertationen

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Shor Algorithm.

Dissertationen zum Thema „Shor Algorithm“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 3. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Shor Algorithm" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

MARTINS, ROBERTO CINTRA. "SHOR S FACTORING ALGORITHM." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35511@1.

Der volle Inhalt der Quelle

Annotation:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>A dissertação apresenta detalhadamente o algoritmo de fatoração de Shor, tanto em termos de sua execução passo a passo como mediante sua representação em forma de circuito, abordando aspectos tanto de sua parte clássica como de sua parte quântica. Inicialmente são apresentados aspectos de teoria dos números indispensáveis para a compreensão do algoritmo e em seguida são desenvolvidos conceitos e propriedades de mecânica quântica e de informação quântica pertinentes. Em atenção ao caráter eminentemente estocástico do algoritmo realiza-se um

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Nwaokocha, Martyns. "Shorův algoritmus v kvantové kryptografii." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-445457.

Der volle Inhalt der Quelle

Annotation:

Kryptografie je velmi důležitým aspektem našeho každodenního života, protože poskytuje teoretický základ informační bezpečnosti. Kvantové výpočty a informace se také stávají velmi důležitou oblastí vědy kvůli mnoha aplikačním oblastem včetně kryptologie a konkrétněji v kryptografii veřejných klíčů. Obtížnost čísel do hlavních faktorů je základem některých důležitých veřejných kryptosystémů, jejichž klíčem je kryptosystém RSA . Shorův kvantový faktoringový al-goritmus využívá zejména kvantový interferenční účinek kvantového výpočtu k faktorovým semi-prime číslům v polynomiálním čase na kvantové

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Nyman, Peter. "Representation of Quantum Algorithms with Symbolic Language and Simulation on Classical Computer." Licentiate thesis, Växjö University, School of Mathematics and Systems Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-2329.

Der volle Inhalt der Quelle

Annotation:

<p>Utvecklandet av kvantdatorn är ett ytterst lovande projekt som kombinerar teoretisk och experimental kvantfysik, matematik, teori om kvantinformation och datalogi. Under första steget i utvecklandet av kvantdatorn låg huvudintresset på att skapa några algoritmer med framtida tillämpningar, klargöra grundläggande frågor och utveckla en experimentell teknologi för en leksakskvantdator som verkar på några kvantbitar. Då dominerade förväntningarna om snabba framsteg bland kvantforskare. Men det verkar som om dessa stora förväntningar inte har besannats helt. Många grundläggande och tekniska pro

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Drobouchevitch, Inna G. "Design and analysis of algorithms for short-route shop scheduling problems." Thesis, University of Greenwich, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.285392.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Blum, Christian. "Metaheuristics for Group Shop Scheduling." Doctoral thesis, Universite Libre de Bruxelles, 2002. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211345.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Ta, Quang-Chieu. "Matheuristic algorithms for minimizing total tardiness in flow shop scheduling problems." Thesis, Tours, 2015. http://www.theses.fr/2015TOUR4002/document.

Der volle Inhalt der Quelle

Annotation:

Nous considérons dans cette thèse un problème d’ordonnancement de flow-shop de permutation où un ensemble de travaux doit être ordonnancé sur un ensemble de machines. Les travaux doivent être ordonnancés sur les machines dans le même ordre. L’objectif est de minimiser le retard total. Nous proposons des algorithmes heuristiques et des nouvelles matheuristiques pour ce problème. Les matheuristiques sont un nouveau type d’algorithmes approchés qui ont été proposés pour résoudre des problèmes d’optimisation combinatoire. Les méthodes importent de la résolution exacte au sein des approches (méta)

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Bandini, Michele. "Crittografia quantistica e algoritmo di Shor." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/17073/.

Der volle Inhalt der Quelle

Annotation:

In questo elaborato si cerca di dare un'idea di come funzioni un computer quantistico, portando come esempio l'Algoritmo di Shor per la fattorizzazione: si cerca di chiarirne la matematica e la fisica che vi stanno dietro e l'importanza applicativa e storica che ha avuto. Brevi cenni sull'odierna tecnologia dei calcolatori quantistici.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Kugel, Felix. "Das Shor-Verfahren als stochastischer Algorithmus." [S.l.] : [s.n.], 2006. http://137.193.200.177/ediss/kugel-felix/meta.html.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Weyer, Anne. "The Brute Force Algorithm." Bowling Green State University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1555605680617133.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Larabi, Mohand. "Le problème de job-shop avec transport : modélisation et optimisation." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2010. http://tel.archives-ouvertes.fr/tel-00625528.

Der volle Inhalt der Quelle

Annotation:

Dans cette thèse nous nous sommes intéressés à l'extension du problème job-shop en ajoutant la contrainte du transport des jobs entre les différentes machines. Dans cette étude nous avons retenu l'existence de deux types de robots, les robots de capacité de chargement unitaire (capacité=1 veut dire qu'un robot ne peut transporter qu'un seul job à la fois) et les robots de capacité de chargement non unitaire (capacité>1 veut dire qu'un robot peut transporter plusieurs job à la fois). Nous avons traité cette extension en deux étapes. Ainsi, la première étape est consacrée au problème du job-shop

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Gilkinson, John C. "An expert scheduling system utilizing a genetic algorithm in solving a multi-parameter job shop problem." Ohio : Ohio University, 1999. http://www.ohiolink.edu/etd/view.cgi?ohiou1175881721.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Thakkar, Darshan Suresh, and darshanst@gmail com. "FPGA Implementation of Short Word-Length Algorithms." RMIT University. Electrical and Computer Engineering, 2008. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080806.140908.

Der volle Inhalt der Quelle

Annotation:

Short Word-Length refers to single-bit, two-bit or ternary processing systems. SWL systems use Sigma-Delta Modulation (SDM) technique to express an analogue or multi-bit input signal in terms of a high frequency single-bit stream. In Sigma-Delta Modulation, the input signal is coarsely quantized into a single-bit representation by sampling it at a much higher rate than twice the maximum input frequency viz. the Nyquist rate. This single-bit representation is almost exclusively filtered to remove conversion quantization noise and sample decimated to the Nyquist frequency in preparation for t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Vilcot, Geoffrey. "Algorithmes approchés pour des problèmes d'ordonnancement multicritères de type job shop flexible et job shop multiressource." Phd thesis, Université François Rabelais - Tours, 2007. http://tel.archives-ouvertes.fr/tel-00198068.

Der volle Inhalt der Quelle

Annotation:

Ce travail de thèse s'inscrit dans le cadre d'une collaboration industrielle avec la société Volume Software pour le développement du module d'ordonnancement du logiciel "DirectPlanning". Dans ce travail, nous étudions le problème de job shop flexible multicritère et le problème de job shop multiressource multicritère. Notre objectif est de déterminer une approximation du front de Pareto. Nous avons proposé des algorithmes de résolution approchés et plus particulièrement des algorithmes de recherche Tabou et des algorithmes génétiques. Nous avons proposé différentes versions de nos méthodes po

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Topalli, Ayca Kumluca. "Hybrid Learning Algorithm For Intelligent Short-term Load Forecasting." Phd thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/627505/index.pdf.

Der volle Inhalt der Quelle

Annotation:

Short-term load forecasting (STLF) is an important part of the power generation process. For years, it has been achieved by traditional approaches stochastic like time series<br>but, new methods based on artificial intelligence emerged recently in literature and started to replace the old ones in the industry. In order to follow the latest developments and to have a modern system, it is aimed to make a research on STLF in Turkey, by neural networks. For this purpose, a method is proposed to forecast Turkey&rsquo<br>s total electric load one day in advance. A hybrid learning scheme that combine

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Yang, Tianshu. "Electric Load Forecasting Using Long Short-term Memory Algorithm." VCU Scholars Compass, 2019. https://scholarscompass.vcu.edu/etd/6027.

Der volle Inhalt der Quelle

Annotation:

Abstract Power system load forecasting refers to the study or uses a mathematical method to process past and future loads systematically, taking into account important system operating characteristics, capacity expansion decisions, natural conditions, and social impacts, to meet specific accuracy requirements. Dependence of this, determine the load value at a specific moment in the future. Improving the level of load forecasting technology is conducive to the planned power management, which is conducive to rationally arranging the grid operation mode and unit maintenance plan, and is conducive

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Povoda, Lukáš. "Rozvrhování úkolů v logistických skladech." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2014. http://www.nusl.cz/ntk/nusl-220620.

Der volle Inhalt der Quelle

Annotation:

The main aim of this thesis is flow shop and job shop scheduling problem in logistics warehouses. Managing and scheduling works is currently often problem. There is no simple solution due to complexity of this problem. This problem must be resolved because of a lack efficiency of work with a higher load such as during the christmas holidays. This paper describes the methods used to solve this problem focusing mainly on the use of search algorithms, evolutionary algorithms, specifically grammar guided genetic programming. This paper describes the problem of job shop scheduling on a simple theor

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

GOLDNER, ELIANA LEITE. "EVALUATION OF A SHORT PATH ALGORITHM FOR SEISMIC HORIZON TRACKING." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2014. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=24300@1.

Der volle Inhalt der Quelle

Annotation:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>FUNDAÇÃO DE APOIO À PESQUISA DO ESTADO DO RIO DE JANEIRO<br>PROGRAMA DE EXCELENCIA ACADEMICA<br>BOLSA NOTA 10<br>A interpretação manual de um horizonte sísmico é um processo muito custoso em termos de tempo de trabalho do intérprete, o que incentiva a pesquisa de métodos automáticos, ou semi automáticos, de rastreamento. Dentre as propostas existentes baseadas em correlação, uma limitação conhecida é o uso de abor

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Sansuke, Maranhão Watanabe Mário. "O algoritmo polinomial de Shor para fatoração em um computador quântico." Universidade Federal de Pernambuco, 2003. https://repositorio.ufpe.br/handle/123456789/7361.

Der volle Inhalt der Quelle

Annotation:

Made available in DSpace on 2014-06-12T18:31:41Z (GMT). No. of bitstreams: 2 arquivo8516_1.pdf: 556858 bytes, checksum: 61691f022e165231e3147bd9b1b11a63 (MD5) license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2003<br>Sistemas de criptografia largamente difundidos como o RSA fundamentam a sua eficiência na suposição de que, em termos práticos, é impossível fatorar números inteiros suficientemente grandes em uma escala de tempo aceitável. Mais precisamente, não existem, até o momento, algoritmos de fatoração em tempo polinomial que possam ser implem

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Freitas, Adriana Xavier. "Algoritmo de Shor e sua aplicação à fatoração de números inteiros." Universidade Federal de Minas Gerais, 2010. http://hdl.handle.net/1843/EABA-85FJXP.

Der volle Inhalt der Quelle

Annotation:

Shors algorithm is a quantum algorithm that finds with high probability the order of an element $x \in Z_{N}^{*}$. One of its applications is the construction of an algorithm that finds the factors of N. In the initial chapters we approach necessary tools for the comprehension of Shors algorithm such as: modular arithmetic, algorithms, continued fractions, basic concepts of quantum computing and Fourier quantum transform. In the following chapters we present Shors algorithm an its application in factorization.<br>O algoritmo de Shor é um algoritmo quântico que encontra com alta probabilidade a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Mohammad, Maruf H. "Blind Acquisition of Short Burst with Per-Survivor Processing (PSP)." Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/46193.

Der volle Inhalt der Quelle

Annotation:

This thesis investigates the use of Maximum Likelihood Sequence Estimation (MLSE) in the presence of unknown channel parameters. MLSE is a fundamental problem that is closely related to many modern research areas like Space-Time Coding, Overloaded Array Processing and Multi-User Detection. Per-Survivor Processing (PSP) is a technique for approximating MLSE for unknown channels by embedding channel estimation into the structure of the Viterbi Algorithm (VA). In the case of successful acquisition, the convergence rate of PSP is comparable to that of the pilot-aided RLS algorithm. However, the pe

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Metta, Haritha. "ADAPTIVE, MULTI-OBJECTIVE JOB SHOP SCHEDULING USING GENETIC ALGORITHMS." UKnowledge, 2008. http://uknowledge.uky.edu/gradschool_theses/518.

Der volle Inhalt der Quelle

Annotation:

This research proposes a method to solve the adaptive, multi-objective job shop scheduling problem. Adaptive scheduling is necessary to deal with internal and external disruptions faced in real life manufacturing environments. Minimizing the mean tardiness for jobs to effectively meet customer due date requirements and minimizing mean flow time to reduce the lead time jobs spend in the system are optimized simultaneously. An asexual reproduction genetic algorithm with multiple mutation strategies is developed to solve the multi-objective optimization problem. The model is tested for single day

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Stein, Clifford. "Approximation algorithms for multicommodity flow and shop scheduling problems." Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/12867.

Der volle Inhalt der Quelle

Annotation:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1992.<br>Includes bibliographical references (leaves 174-179).<br>by Clifford Stein.<br>Ph.D.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Czerwinski, Steven E. (Steven Edward). "Exploring the job-shop search space with genetic algorithms." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42747.

Der volle Inhalt der Quelle

Annotation:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.<br>Includes bibliographical references (leaves 52-53).<br>by Steven E. Czerwinski.<br>M.Eng.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Paschou, Michail. "ASIC implementation of LSTM neural network algorithm." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254290.

Der volle Inhalt der Quelle

Annotation:

LSTM neural networks have been used for speech recognition, image recognition and other artificial intelligence applications for many years. Most applications perform the LSTM algorithm and the required calculations on cloud computers. Off-line solutions include the use of FPGAs and GPUs but the most promising solutions include ASIC accelerators designed for this purpose only. This report presents an ASIC design capable of performing the multiple iterations of the LSTM algorithm on a unidirectional and without peepholes neural network architecture. The proposed design provides arithmetic level

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Arrieta, Aitor. "FB-Environment in Wise-Shop Floor : Algorithm parser and code generation." Thesis, Högskolan i Skövde, Forskningscentrum för Virtuella system, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-6594.

Der volle Inhalt der Quelle

Annotation:

IEC (International Electrotechnical Commission) is the authority that publishes different standards in the fields of electrical and electronics engineering, to be used internationally. In the area of manufacturing, it has demanded a new standard to fulfil better solutions of dynamic requirements. The IEC 61499 redacted by IEC offers interoperability, portability, configurability and distributed control applications for manufacturing processes. However, this standard is not a replacement of IEC 61131-3, one of the most used standards in industry; instead, it

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Silwal, Hari. "MULTISTEP FRAMEWORK FOR SHORT-TERM LOAD FORECASTING USING MACHINE LEARNING ALGORITHM." OpenSIUC, 2018. https://opensiuc.lib.siu.edu/theses/2312.

Der volle Inhalt der Quelle

Annotation:

Traditional forecasting approaches forecast the total system load directly without considering the individual consumer's load. With the introduction of the smart grid, lots of renewable energy resources such as wind and solar are added to the system from consumer side fluctuates the system load and makes forecasting more complex. Thus, it is necessary to forecast individual consumers load. Here, a framework is presented in which individual customer loads is forecasted rather than the system load. At first, a hierarchical cluster analysis is performed to classify daily load patterns into differ

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Yang, Fengyu, and 楊丰羽. "Machine-order search space for job-shop scheduling." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B31246205.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Al-Hinai, Nasr. "OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS." Flexible Services and Manufacturing Journal, 2011. http://hdl.handle.net/1993/4955.

Der volle Inhalt der Quelle

Annotation:

Flexible job-shop scheduling problem (FJSP) is a generalization of the classical job-shop scheduling problem (JSP). It takes shape when alternative production routing is allowed in the classical job-shop. However, production scheduling becomes very complex as the number of jobs, operations, parts and machines increases. Until recently, scheduling problems were studied assuming that all of the problem parameters are known beforehand. However, such assumption does not reflect the reality as accidents and unforeseen incidents happen in real manufacturing systems. Thus, an optimal schedule that is

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Gandhi, Sachin. "Learning from a Genetic Algorithm with Inductive Logic Programming." Ohio University / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1125511501.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Schilling, Gordian Hansjoerg. "Algorithms for short-term and periodic process scheduling and rescheduling." Thesis, Imperial College London, 1998. http://hdl.handle.net/10044/1/7696.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Mok, Esmond Chi Ming. "A new ambiguity function algorithm for short baseline GPS engineering surveying applications." Thesis, University of Newcastle Upon Tyne, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318165.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Feng, Wenlan. "Modelling market demand and manufacturing response using genetic algorithms." Thesis, Glasgow Caledonian University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361094.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Hasan, S. M. Kamrul Engineering &amp Information Technology Australian Defence Force Academy UNSW. "Evolutionary algorithms for solving job-shop scheduling problems in the presence of process interruptions." Awarded by:University of New South Wales - Australian Defence Force Academy. Engineering & Information Technology, 2009. http://handle.unsw.edu.au/1959.4/43768.

Der volle Inhalt der Quelle

Annotation:

In this thesis, the Job Shop Scheduling Problem (JSSP) is the problem of interest. The classical JSSP is well-known as an NP-hard problem. Although with current computational capabilities, the small problems are solvable using deterministic methods, it is out of reach when they are larger in size. The complexity of JSSP is further increased when process interruptions, such as machine breakdown and/or machine unavailability, are introduced. Over the last few decades, several stochastic algorithms have been proposed to solve JSSPs. However, none of them are suitable for all kinds of probl

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Shah, Nihar. "Using Distributed Computing To Improve The Performance Of Genetic Algorithms For Job Shop Scheduling Problems." Ohio University / OhioLINK, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1103232246.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Vasquez, Julio Cesar Delgado. "Programação de tarefas em um ambiente flow shop com m máquinas para a minimização do desvio absoluto total de uma data de entrega comum." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-11122017-123449/.

Der volle Inhalt der Quelle

Annotation:

Neste trabalho abordamos o problema de programação de tarefas em um ambiente flow shop permutacional com mais de duas máquinas. Restringimos o estudo para o caso em que todas as tarefas têm uma data de entrega comum e restritiva, e onde o objetivo é minimizar a soma total dos adiantamentos e atrasos das tarefas em relação a tal data de entrega. É assumido também um ambiente estático e determinístico. Havendo soluções com o mesmo custo, preferimos aquelas que envolvem menos tempo de espera no buffer entre cada máquina. Devido à dificuldade de resolver o problema, mesmo para instâncias pequenas

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Fanti, Gioele. "Algoritmo di schedulazione per il problema di Job-Shop." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/22178/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Raveendran, Nithin. "A Modified Sum-Product Algorithm over Graphs with Short Cycles." Thesis, 2015. http://etd.iisc.ernet.in/2005/3847.

Der volle Inhalt der Quelle

Annotation:

We investigate into the limitations of the sum-product algorithm for binary low density parity check (LDPC) codes having isolated short cycles. Independence assumption among messages passed, assumed reasonable in all configurations of graphs, fails the most in graphical structures with short cycles. This research work is a step forward towards understanding the effect of short cycles on error floors of the sum-product algorithm. We propose a modified sum-product algorithm by considering the statistical dependency of the messages passed in a cycle of length 4. We also formulate a modified algor

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Kugel, Felix [Verfasser]. "Das Shor-Verfahren als stochastischer Algorithmus / Felix Kugel." 2006. http://d-nb.info/982288166/34.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Soares, Sophia de Queiroz. "Escalonamento da produção num sistema job-shop flexível: aplicação ao fabrico de pavimentos de madeira." Master's thesis, 2021. http://hdl.handle.net/10316/95536.

Der volle Inhalt der Quelle

Annotation:

Dissertação de Mestrado em Engenharia e Gestão Industrial apresentada à Faculdade de Ciências e Tecnologia<br>This work is based on a curricular internship at the startup SimpleAxis, in Portugal, as part of the Masters in Industrial and Management Engineering at the University of Coimbra. Its main objective is to propose a solution related to the production scheduling of Castro Wood Floors enterprise, in order to minimize the makespan and the tardiness in deliveries in order to optimize the production process creating new opportunities of development to the company.In this sense, initially, a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Heng-Lei, Su, and 蘇恆磊. "Genetic Algorithms for Job-Shop Scheduling." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/23996197435893773713.

Der volle Inhalt der Quelle

Annotation:

碩士<br>國立海洋大學<br>系統工程暨造船學系<br>90<br>Abstract The job-shop scheduling problem is an important problem in the operation production management. During the last few decades, an efficient algorithm hasn’t been found yet for optimizing it in polynomial time. Based on the genetic algorithms is used to solve job-shop scheduling problem in this thesis. Firstly, to describe operation process, limits, performance, and the rule on dispatch in the job-shop scheduling problem. Secondly, to introduce the basic framework and important parameters such as crossover rate, mutation rate and p

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Chen, Yi-Shin, and 陳宜欣. "A Natural Genetic Algorithm for Job Shop Problem." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/06795599174634190358.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Zheng, Jie-Ting, and 鄭价廷. "Applications of Genetic Algorithm to Job-Shop Scheduling." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/96943505372410130410.

Der volle Inhalt der Quelle

Annotation:

碩士<br>國立高雄第一科技大學<br>機械與自動化工程所<br>90<br>In this thesis, we confer using Genetic Algorithm to improve the scheduling of production plan about a job-shop scheduling problem. How to shorten total working time of production scheduling is a goal of research in the thesis. In the thesis, we research in two directions: (1) We discuss the result with using differential GA operators, and observe the influence of differential operators for the purpose of getting the best operation mold, which tends to optimal solution more. For selecting the parameter of genetic algorithm, we use Taguchi method to find t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Hsiao, Yi-Mei, and 蕭義梅. "Application of Genetic Algorithm in Job-Shop Scheduling." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/44570963801521937844.

Der volle Inhalt der Quelle

Annotation:

碩士<br>元智大學<br>工業工程研究所<br>87<br>In factory, it is an important problem for scheduling rapidly, and genetic algorithm is a popular method to solve the NP-hard scheduling problem. In tradition, using genetic algorithm to solve the problem needs a long time, but ''time'' is the most important problem in scheduling. This research intends to how to use the character of genetic algorithm to escape the trap in local solution, and exclude the long time of evolution from the genetic algorithm, then get the better solution in short time. In this research, we develop a combination of

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Liu, Chung-Yang, and 劉忠陽. "Flexible Flow Shop Scheduling: Algorithm Design and Application." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/47483807357045202753.

Der volle Inhalt der Quelle

Annotation:

博士<br>國立臺灣大學<br>電機工程學研究所<br>88<br>This thesis presents a Lagrangian relaxation-based approach for production scheduling of flexible flow shops where backup and sequence-dependent setup effects (time and cost) are significant. It is well known as an NP-hard problem. Backup machine effects are modeled as using alternative machines with prioritized processing cost. In the presence of setup effects, setup status of a machine must be scheduled in accordance with individual part production schedules. The scheduling problem is formulated as a separable integer programming problem with capacity co

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Yang, Po-Tung, and 楊博棟. "Fuzzy Clustering Algorithm on Short Time Series Data." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/2347bj.

Der volle Inhalt der Quelle

Annotation:

碩士<br>中原大學<br>數學研究所<br>103<br>In this thesis, we propose Alternative Fuzzy Short Times Series Clustering Algorithm (A-FSTS). This thesis was to observe whether the new algorithm is better than Fuzzy Short Time Series Clustering Algorithm [3]. We using Fuzzy Short Time Series Clustering Algorithm (FSTS) [3] for Short Time Series data with outliers have some problem and the classification results are incorrect, because Fuzzy Short Time Series Clustering Algorithm [3] is based on Fuzzy C-Means Algorithm (FCM). We want to improve this problem, So we will combine distance of Short Time Series [3] a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Yen, Nguyen Thi Hong, and 阮氏紅燕. "A VND ALGORITHM FOR JOB SHOP SCHEDULING PROBLEM." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/bvpmk6.

Der volle Inhalt der Quelle

Annotation:

碩士<br>元智大學<br>工業工程與管理學系<br>106<br>In this study, we consider the scheduling problem for job shop environment with the objective to minimize the makespan. Variable neighborhood descent (VND) algorithm with two versions VNDI and VNDII is proposed to solve the problem. Besides, two simple neighborhood structures based on critical operation concept are generated to be implemented with VND algorithm. Preliminary test is performed to evaluate performance of two versions of VND and the obtained results indicates that VNDI outperforms VNDII with better solution and shorter computational time. Computat

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Panto, Frans Januar, and 潘英發. "A job-shop scheduling algorithm based on hybrid bees algorithm combined with tabu search." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/98841233860316804705.

Der volle Inhalt der Quelle

Annotation:

碩士<br>國立臺灣科技大學<br>資訊工程系<br>98<br>The job-shop scheduling problem is one of the most NP-Hard problems and has attracted many researchers to develop new algorithm based on heuristic or meta-heuristic approach. Many algorithms based on Genetic Algorithm, Particle Swarm Optimization, Ant Colony Optimization have been proposed to solve it, respectively but the results are still not yet satisfactory. In this paper we proposed a new algorithm based on bees algorithm which is very good for discrete optimization problem; furthermore, the results are optimized with the famous tabu search for local searc

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Jia-WeiChang and 張家瑋. "A Semantic Similarity Evaluation Algorithm for English Short-Texts." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/19015816367253207242.

Der volle Inhalt der Quelle

Annotation:

碩士<br>國立成功大學<br>工程科學系碩博士班<br>100<br>In recent years, there is a growing need for precise and fast Information Retrieval (IR) services, which gradually push information providing systems to use Information Retrieval techniques based on natural language queries. This study presents an algorithm to evaluate the semantic similarity between English short texts and aims to enhance the execution efficiency and the accuracy on information retrieving. For the embedded information in a short text is limited, applying well-known IR models, such as LSA, HAL and etc., directly may not always perfectly quan

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Lin, Hsiao-Jou, and 林孝柔. "Flexible Job Shop Scheduling using a Multiobjective Memetic Algorithm." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/51223601763201114988.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Chung, Chi-Hsun, and 鍾奇勳. "Solving Job-Shop Scheduling Problems by Boltzmann Genetic Algorithm." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/63294904306332949902.

Der volle Inhalt der Quelle

Annotation:

碩士<br>國立臺灣科技大學<br>工業管理系<br>97<br>Job-shop scheduling problem (JSP), which was wildly used in industries, plays a vital role in manufacture scheduling. Many of the high-tech industries such as semiconductor industries, TFT-LCD industries belong to the Job-shop scheduling. Nevertheless, due to the variation of JSP, its combinatorial optimization problem in scheduling is recognized as one of the most complicated NP-hard problems. Many experts and scholars use the Generic algorithm to seek out the JSP problem, and its powerful searching ability of Genetic algorithm (GA) was widely applied in sc

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!