Log in

Relevant bibliographies by topics / Shor algoritmi / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Shor algoritmi.

Dissertations / Theses on the topic 'Shor algoritmi'

Author: Grafiati

Published: 5 June 2025

Last updated: 2 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Shor algoritmi.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Gatti, Lorenzo. "Algoritmi quantistici e classi di complessità." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/9128/.

Full text

Abstract:

Solitamente il concetto di difficoltà è piuttosto soggettivo, ma per un matematico questa parola ha un significato diverso: anche con l’aiuto dei più potenti computer può essere impossibile trovare la soluzione di un sudoku, risolvere l’enigma del commesso viaggiatore o scomporre un numero nei suoi fattori primi; in questo senso le classi di complessità computazionale quantificano il concetto di difficoltà secondo le leggi dell’informatica classica. Una macchina quantistica, però, non segue le leggi classiche e costituisce un nuovo punto di vista in una frontiera della ricerca legata alla riso

APA, Harvard, Vancouver, ISO, and other styles

2

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.

Full text

Abstract:

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, and other styles

3

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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.

Full text

Abstract:

<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, and other styles

5

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

Full text

Abstract:

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, and other styles

6

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.

Full text

Abstract:

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, and other styles

7

Maturo, Nicola. "Short codes for telecommand space link." Doctoral thesis, Università Politecnica delle Marche, 2016. http://hdl.handle.net/11566/243142.

Full text

Abstract:

Lo scopo di questa tesi ´e studiare l’impatto di diversi algoritmi di decodifica sulle performance dei codici a correzione d’errore proposti per l’aggiornamento dello standard del telocommand link nelle missioni spaziali, che sono rappresentati dai codici Low Density Parity Check (LDPC) binari e non binari. Per la valutazione delle performance si sono considerati tre diversi modelli di canale di grande rilevanza nello comunicazioni con lo spazio, ossia: Additive White Gaussian Noise (AWGN), canale AWGN con pulsed jamming e canale AWGN con scintillazione solare; e tre diverse metriche, ossia:

APA, Harvard, Vancouver, ISO, and other styles

8

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.

Full text

Abstract:

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, and other styles

9

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.

Full text

Abstract:

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, and other styles

10

Thomopulos, Dimitri. "Algoritmi esatti per il Job Shop Scheduling: approcci Mathematical Programming." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2012. http://amslaurea.unibo.it/3450/.

Full text

Abstract:

In questa tesi ci occuperemo di fornire un modello MIP di base e di alcune sue varianti, realizzate allo scopo di comprenderne il comportamento ed eventualmente migliorarne l’efficienza. Le diverse varianti sono state costruite agendo in particolar modo sulla definizione di alcuni vincoli, oppure sui bound delle variabili, oppure ancora nell’obbligare il risolutore a focalizzarsi su determinate decisioni o specifiche variabili. Sono stati testati alcuni dei problemi tipici presenti in letteratura e i diversi risultati sono stati opportunamente valutati e confrontati. Tra i riferimenti per

APA, Harvard, Vancouver, ISO, and other styles

11

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

Full text

Abstract:

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, and other styles

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.

Full text

Abstract:

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, and other styles

13

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/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

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.

Full text

Abstract:

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, and other styles

17

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.

Full text

Abstract:

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, and other styles

18

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

Full text

Abstract:

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, and other styles

19

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

Full text

Abstract:

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, and other styles

20

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.

Full text

Abstract:

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, and other styles

21

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

Full text

Abstract:

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, and other styles

22

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Oliveira, Ronald Lopes de. "Escalonamento de um Job Shop : análise de um algoritmo com regras heurísticas." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2001. http://hdl.handle.net/10183/3741.

Full text

Abstract:

O presente trabalho visa definir um modelo de alocação dos recursos da produção para centros de trabalho em sistemas baseados em job shop, usando a abordagem heurística para garantir uma boa alocação dos recursos. São levados em conta a complexidade de um ambiente de produção, seus aspectos temporais e os modelos de Job Shop Scheduling atualmente em uso. Com isso são examinados os aspectos conceituais deste ambiente e proposto um modelo de alocação de recursos para auxiliar no planejamento operacional do mesmo. Pode-se definir os recursos como todos os elementos necessários à execução das dive

APA, Harvard, Vancouver, ISO, and other styles

25

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.

Full text

Abstract:

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, and other styles

26

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

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.

Full text

Abstract:

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, and other styles

28

Kairaitis, Gediminas. "Tvarkaraščių sudarymo uždavinių ir jų algoritmų tyrimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2010. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100825_101713-01675.

Full text

Abstract:

Tvarkaraščių sudarymo uždaviniai – viena iš sunkiau sprendžiamų problemų, kylančių įvairiose gamybinėse struktūrose, grupė. Darbo pradžioje supažindinama su bendrais tvarkaraščių sudarymo uždavinių bruožais ir jų sprendimo algoritmais. Detaliau nagrinėti šiame darbe parenkamas vienas sunkiausių gamybinių tvarkaraščių ir apskritai kombinatorinių optimizavimo uždavinių – darbo fabriko uždavinys (angl. job shop scheduling problem), kuris be abejo nėra tiksliai sprendžiamas per polinominį sprendimo laiką. Šio uždavinio pradiniai duomenys yra duotos darbų ir įrenginių aibės. Kiekvienas darbas apdor

APA, Harvard, Vancouver, ISO, and other styles

29

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/.

Full text

Abstract:

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, and other styles

30

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Ribeiro, Sildenir Alves. "Sistema imune artificial para o problema de escalonamento Job Shop." Universidade Federal do Espírito Santo, 2006. http://repositorio.ufes.br/handle/10/6365.

Full text

Abstract:

Made available in DSpace on 2016-12-23T14:33:37Z (GMT). No. of bitstreams: 1 dissertacao.pdf: 1052399 bytes, checksum: b17ce224ca3822e277c997fd00bd2c67 (MD5) Previous issue date: 2006-11-29<br>Este trabalho apresenta um Sistema Imune Artificial (SIA) para tratar problemas de escalonamento. O Sistema Imunológico Artificial desenvolvido neste projeto baseia-se na estrutura arquitetura e funcionamento dos Sistemas Imunes Biológicos ou Naturais. O uso de Algoritmo Genético (AG) fez-se necessário para gerar os indivíduos a serem escalonados, representando os antígenos e anticorpos do SIA. Cad

APA, Harvard, Vancouver, ISO, and other styles

32

Mannino, Enrico. "Metodi e strumenti di supporto decisionale per l’automatizzazione del Facility Layout Planning in sistemi di produzione Job-Shop." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021.

Find full text

Abstract:

L'elaborato di tesi si concentra sulla progettazione di strumenti atti all'automatizzazione di alcune fasi di costruzione di layout industriali, con l'obiettivo di posizionare reparti ed elementi all'interno del layout minimizzando i costi di movimentazione dei materiali. Dopo uno studio approfondito del tema del layout industriale e dei metodi di risoluzione del Facility Layout Problem tramite algoritmi euristici, migliorativi, metaeuristici oppure ottimi, si discute lo sviluppo di un programma automatizzato di re-layout, svolto in ambiente Visual Basic di Microsoft Excel, lungo tutte le sue

APA, Harvard, Vancouver, ISO, and other styles

33

Simões, Wagner Lourenzi. "Abordagem metaheurística híbrida para a otimização de sequenciamento de produção em Flow Shop Permutacional com tempos de setup dependentes da sequência." Universidade do Vale do Rio dos Sinos, 2016. http://www.repositorio.jesuita.org.br/handle/UNISINOS/6022.

Full text

Abstract:

Submitted by Silvana Teresinha Dornelles Studzinski (sstudzinski) on 2017-02-08T15:41:51Z No. of bitstreams: 1 Wagner Lourenzi Simões_.pdf: 1389162 bytes, checksum: 302aec842d2f4e8b0a7c78ecbae24357 (MD5)<br>Made available in DSpace on 2017-02-08T15:41:51Z (GMT). No. of bitstreams: 1 Wagner Lourenzi Simões_.pdf: 1389162 bytes, checksum: 302aec842d2f4e8b0a7c78ecbae24357 (MD5) Previous issue date: 2016-12-06<br>CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>Neste estudo, foi desenvolvida uma ferramenta computacional baseada em metaheurísticas para a otimização do seq

APA, Harvard, Vancouver, ISO, and other styles

34

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

Full text

Abstract:

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, and other styles

35

Ramírez, Rodríguez César Oswaldo. "Un algoritmo GRASP con doble relajación para resolver problema del flow shop scheduling." Bachelor's thesis, Pontificia Universidad Católica del Perú, 2006. http://tesis.pucp.edu.pe/repositorio/handle/123456789/368.

Full text

Abstract:

La mayoría de líneas de producción, incluso las grandes, no tienen una forma adecuada de planificar su producción, optando por distribuciones manuales, producto del conocimiento del jefe de planta o repitiendo alguna anterior con realidades distintas. Esto conlleva a que los recursos (trabajadores, maquinas) estén sin trabajar (ociosas) hasta ser utilizadas, manteniendo las máquinas prendidas, consumiendo combustible y los trabajadores especialistas en una tarea, haciendo otra tarea.<br>Tesis

APA, Harvard, Vancouver, ISO, and other styles

36

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.

Full text

Abstract:

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, and other styles

37

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.

Full text

Abstract:

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, and other styles

38

Healy, Cornelius Thomas. "Short-length low-density parity-check codes : construction and decoding algorithms." Thesis, University of York, 2014. http://etheses.whiterose.ac.uk/7875/.

Full text

Abstract:

Error control coding is an essential part of modern communications systems. LDPC codes have been demonstrated to offer performance near the fundamental limits of channels corrupted by random noise. Optimal maximum likelihood decoding of LDPC codes is too complex to be practically useful even at short block lengths and so a graph-based message passing decoder known as the belief propagation algorithm is used instead. In fact, on graphs without closed paths known as cycles the iterative message passing decoding is known to be optimal and may converge in a single iteration, although identifying t

APA, Harvard, Vancouver, ISO, and other styles

39

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

Full text

Abstract:

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, and other styles

40

Beck, Felipe Luís. "Escalonamento de tarefas job-shop realistas utilizando algoritmos genéticos em MATLAB." Florianópolis, SC, 2000. http://repositorio.ufsc.br/xmlui/handle/123456789/79269.

Full text

Abstract:

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia Elétrica.<br>Made available in DSpace on 2012-10-18T01:17:35Z (GMT). No. of bitstreams: 0Bitstream added on 2014-09-25T17:12:43Z : No. of bitstreams: 1 182500.pdf: 4247647 bytes, checksum: 0d4e57bcc3bd8849bd1c880bb4c11cca (MD5)<br>Esta dissertação aborda o desenvolvimento e a implementação de um sistema para escalonamento de tarefas do tipo job-shop. Com o sistema que foi desenvolvido, é possível o tratamento não apenas de problemas clássicos, como também de problemas r

APA, Harvard, Vancouver, ISO, and other styles

41

Allaoui, Hamid. "Hybrid flow shop scheduling with maintenance constraints : complexity, algorithms and application." Paris 6, 2004. http://www.theses.fr/2004PA066426.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

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.

Full text

Abstract:

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, and other styles

44

Candido, Marco Antonio Barbosa. "A hybrid genetic approach to solve real make-to-order job shop scheduling problems." reponame:Repositório Institucional da UFSC, 1997. https://repositorio.ufsc.br/xmlui/handle/123456789/158165.

Full text

Abstract:

Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnologico<br>Made available in DSpace on 2016-01-08T22:12:41Z (GMT). No. of bitstreams: 1 107336.pdf: 3622415 bytes, checksum: 953f1623eaa5c472c4fa60df73f7c69d (MD5) Previous issue date: 1997<br>Procedimentos de busca local (ex. busca tabu) e algoritmos genéticos têm apresentado excelentes resultados em problemas clássicos de programação da produção em ambientes job shop. No entanto, estas abordagens apresentam pobres habilidades de modelamento e poucas aplicações com restrições de ambientes reais de produção têm sido public

APA, Harvard, Vancouver, ISO, and other styles

45

Ferreira, Guilherme de Souza. "Algoritmos genéticos adaptativos para solucionar problemas de sequenciamento do tipo job-shop flexível." Universidade Federal de Juiz de Fora (UFJF), 2018. https://repositorio.ufjf.br/jspui/handle/ufjf/6836.

Full text

Abstract:

Submitted by Renata Lopes (renatasil82@gmail.com) on 2018-05-25T13:02:54Z No. of bitstreams: 1 guilhermedesouzaferreira.pdf: 1163831 bytes, checksum: ec0bec904b2e6110d9b9e4934727f35d (MD5)<br>Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2018-06-14T11:52:03Z (GMT) No. of bitstreams: 1 guilhermedesouzaferreira.pdf: 1163831 bytes, checksum: ec0bec904b2e6110d9b9e4934727f35d (MD5)<br>Made available in DSpace on 2018-06-14T11:52:03Z (GMT). No. of bitstreams: 1 guilhermedesouzaferreira.pdf: 1163831 bytes, checksum: ec0bec904b2e6110d9b9e4934727f35d (MD5) Prev

APA, Harvard, Vancouver, ISO, and other styles

46

Módolo, Junior Valdemar. "Estudo comparativo de diferentes representações cromossômicas nos algoritmos genéticos em problemas de sequenciamento da produção em job shop." Universidade Nove de Julho, 2015. http://bibliotecadigital.uninove.br/handle/tede/1371.

Full text

Abstract:

Submitted by Nadir Basilio (nadirsb@uninove.br) on 2016-06-01T14:43:08Z No. of bitstreams: 1 Valdemar Modolo Junior.pdf: 2802590 bytes, checksum: f3956818acd10efc3244abc007294827 (MD5)<br>Made available in DSpace on 2016-06-01T14:43:08Z (GMT). No. of bitstreams: 1 Valdemar Modolo Junior.pdf: 2802590 bytes, checksum: f3956818acd10efc3244abc007294827 (MD5) Previous issue date: 2015-06-10<br>Among the optimization methods, the Genetic Algorithm (GA) has been producing good results in problems with high order of complexity, such as, for example, the production scheduling problem in job shop envi

APA, Harvard, Vancouver, ISO, and other styles

47

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

Full text

Abstract:

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, and other styles

48

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

Full text

Abstract:

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, and other styles

49

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.

Full text

Abstract:

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, and other styles

50

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

Full text

Abstract:

碩士<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, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!