Relevant bibliographies by topics / Shor algoritmi

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Shor algoritmi"

1

Shukhrat, Toirov Abduganiyevich, and Eldor Islomovich Saidakhmedov. "Enhancing post-quantum security through hybrid cryptographic systems integrating quantum key distribution." Yashil iqtisodiyot va taraqqiyot 3, no. 1 (2025): 12–14. https://doi.org/10.5281/zenodo.14910585.

Full text
Abstract:
Kvant hisoblash texnologiyasining rivojlanishi bilan klassik kriptografik tizimlarning zaifligi oshmoqda.Ayniqsa, Shor algoritmi [1] kabi kvant hujumlari RSA va ECC kabi tizimlarni buzish imkoniyatiga ega. Shu sababli, postkvantkriptografiyasi (PQC) sohasida yangi algoritmlar ishlab chiqilmoqda. Ushbu maqola FURE (Fast Unitary RandomEncoding) algoritmini post-kvant xavfsizlikni oshirish vositasi sifatida ko‘rib chiqadi. FURE algoritmi unitar kodlash vatasodifiy unitar transformatsiyalar yordamida ma’lumotlarni himoya qilishga asoslangan bo‘lib, kvant hujumlariga qarshisezgirl
APA, Harvard, Vancouver, ISO, and other styles
2

Salayev, Alisher Kuralbayevich. "KVANT KOMPYUTERLARI VA ULARNING ZAMONAVIY KRIPTOGRAFIYAGA TAHDIDI." ILMIY TADQIQOT VA INNOVATSIYA 1, no. 5 (2022): 27–29. https://doi.org/10.5281/zenodo.7424720.

Full text
Abstract:
<em>Ushbu maqola hisoblash texnologiyalarining yanggi avlodi bo&lsquo;lgan kavant kompyuterining imkoniyatlari va uning zamonaviy kriptografiyaga bo&lsquo;lgan ta&rsquo;siri mavzusiga bag&lsquo;ishlangan. </em>
APA, Harvard, Vancouver, ISO, and other styles
3

Wahyudi, Didik, Ervin Medianti, and Tessa Vanina Soetanto. "PERBANDINGAN KINERJA ALGORITMA GENETIKA DAN ALGORITMA HEURISTIK RAJENDRAN UNTUK PENJADUALAN PRODUKSI JENIS FLOW SHOP." Jurnal Teknik Industri 1, no. 1 (2004): 41–50. http://dx.doi.org/10.9744/jti.1.1.41-50.

Full text
Abstract:
Flow shop scheduling problem is to schedule a production process of n jobs that go through the same process sequence and the same m machines. Most researches are don to accomplish only one objective, i.e. minimizing makespan. The other objective, such as total flow time, or multiple objectives that is minimizing makespan, total flow time and machine idle time, will be more effective in reducing scheduling cost, as written in French (1982).&#x0D; Rajendran algorithm (1995) that solves flow shop problem with multiple objectives will be used to evaluate the proposed algorithm: Genetic Algorithm,
APA, Harvard, Vancouver, ISO, and other styles
4

Kamil, Mochamad, and Yustika Erliani. "Implementasi Algoritma C4.5 Untuk Memprediksi Penjualan Sepatu Boots Terlaris di Toko Parabellum." Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi) 9, no. 3 (2025): 852–65. https://doi.org/10.35870/jtik.v9i3.3562.

Full text
Abstract:
In the busines world, especially the shoe shop business, a marketing strategy is needed in order to increase product sales. One of the shoe shop businesses is parabellum. The high number of visitors to Parabellum’s online and offlie stores resulted in the stock of boots being sold out, so that when customers looked for a variety og boots, these boots were no longer available. From this problem, the author helps predict by analyzing data processing using a comparison og the C4.5 algorithm, where the C4.5 algorithm is an algorithm, it will have accurate result in predicting shoe sales data at th
APA, Harvard, Vancouver, ISO, and other styles
5

Mzili, Toufik, Ilyass Mzili, Mohammed Essaid Riffi, Dragan Pamucar, Mohamed Kurdi, and Hasan Ali. "Optimizing production scheduling with the spotted hyena algorithm: A novel approach to the flow shop problem." Reports in Mechanical Engineering 4, no. 1 (2023): 90–103. http://dx.doi.org/10.31181/rme040116072023m.

Full text
Abstract:
The spotted hyena optimization algorithm (SHOA) is a novel approach for solving the flow shop-scheduling problem in manufacturing and production settings. The motivation behind SHOA is to simulate the social dynamics and problem-solving behaviors of spotted hyena packs in order to identify and implement optimal schedules for jobs in a flow shop environment. This approach is unique compared to other optimization algorithms such as WOA, GWO, and BA. Through extensive experimentation, SHOA has been shown to outperform traditional algorithms in terms of solution quality and convergence speed. The
APA, Harvard, Vancouver, ISO, and other styles
6

Ogi, Dion, Fitra Hutomo, and Rini Wisnu Wardhani. "Implementasi Algoritme Shor pada Sirkuit Kuantum untuk Cracking Algoritme RSA." Info Kripto 16, no. 3 (2022): 111–18. http://dx.doi.org/10.56706/ik.v16i3.62.

Full text
Abstract:
Penelitian ini membahas mengenai pemanfaatan teknologi quantum computing berupa sirkuit kuantum modular exponentiation untuk mencari periode dari algoritma Shor yang digunakan untuk memfaktorkan bilangan prima N yang digunakan dalam algoritma RSA. Sirkuit modular exponentiation yang digunakan dalam penelitian ini terdiri dari sirkuit adder, reverse adder, modular adder, reverse modular adder, modular multiplier dan reverse modular multiplier yang didesain menggunakan pendekatan dari VBE. Penelitian ini berhasil mengimplementasikan sirkuit modular exponentiation 8 bit dengan MSB bernilai 1 meng
APA, Harvard, Vancouver, ISO, and other styles
7

Jia Shangen, 贾尚恩, 安俊睿 An Junrui, 周光泉 Zhou Guangquan, 何思渊 He Siyuan та 周平 Zhou Ping. "基于自适应短时傅里叶变换的结构光场单帧三维成像算法". Laser & Optoelectronics Progress 60, № 8 (2023): 0811025. http://dx.doi.org/10.3788/lop223376.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Souza, Rodrigo de, and Antônio Cesar Galhardi. "Sharing sensitive supply chain information: A study on vulnerabilities in RSA encryption systems from the use of the shor algorithm." @_GIT (Advances in Global Innovation & Technology) 3, no. 2 (2025): e32015. https://doi.org/10.29327/2384439.3.2-3.

Full text
Abstract:
This work proposes a comparative analysis of algorithms, considering Shor's Algorithm as a basis. The ChatGPT artificial intelligence tool is used in the work, asking it to create codes in the Qiskit language and quantum computing at two moments: August 2023 and February 2024. The results showed that there was considerable learning from the ChatGPT tool in relation to better strategies for implementing the algorithm, in such a way that, considering the last suggestion, from February 2024, there is a considerable risk to RSA encryption, if this type of code is implemented without supervision in
APA, Harvard, Vancouver, ISO, and other styles
9

Mzili, Toufik, Ilyass Mzili, Mohammed Essaid Riffi, and Gaurav Dhiman. "Hybrid Genetic and Spotted Hyena Optimizer for Flow Shop Scheduling Problem." Algorithms 16, no. 6 (2023): 265. http://dx.doi.org/10.3390/a16060265.

Full text
Abstract:
This paper presents a new hybrid algorithm that combines genetic algorithms (GAs) and the optimizing spotted hyena algorithm (SHOA) to solve the production shop scheduling problem. The proposed GA-SHOA algorithm incorporates genetic operators, such as uniform crossover and mutation, into the SHOA algorithm to improve its performance. We evaluated the algorithm on a set of OR library instances and compared it to other state-of-the-art optimization algorithms, including SSO, SCE-OBL, CLS-BFO and ACGA. The experimental results show that the GA-SHOA algorithm consistently finds optimal or near-opt
APA, Harvard, Vancouver, ISO, and other styles
10

Stutz, Joëlle Christina, Beatriz Vidondo, Alessandra Ramseyer, Ugo Ettore Maninchedda, and Antonio M. Cruz. "Effect of three types of horseshoes and unshod feet on selected non-podal forelimb kinematic variables measured by an extremity mounted inertial measurement unit sensor system in sound horses at the trot under conditions of treadmill and soft geotextile surface exercise." Veterinary Record Open 5, no. 1 (2018): e000237. http://dx.doi.org/10.1136/vetreco-2017-000237.

Full text
Abstract:
Therapeutic farriery is part of the management of certain orthopaedic conditions. Non-podal parameters are important as most horses shod with therapeutic shoes are expected to perform again and the choice of shoe type may be influenced by the effects they may have on gait. The aim of this prospective study was to evaluate the effects of three different shoe designs and unshod front feet on forelimb non-podal kinematic variables using an extremity mounted inertial measurement unit (IMU) system under conditions of treadmill and overground exercise on a soft geotextile surface at the trot. Ten so
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Shor algoritmi"

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
More sources

Books on the topic "Shor algoritmi"

1

Asquith, Paul. Short sales and trade classification algorithms. National Bureau of Economic Research, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Song, Yingsheng. Genetic algorithms for job shop scheduling. The Author], 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

George, Vairaktarakis, ed. Flow shop scheduling: Theoretical results, algorithms, and applications. Springer Verlag, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

United States. National Aeronautics and Space Administration., ed. FNAS short term solar flare prediction algorithm: Semi-annual report, February 1, 1993 - August 1, 1993. National Aeronautics and Space Administration, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

United States. National Aeronautics and Space Administration., ed. FNAS short term solar flare prediction algorithm: Semi-annual report, February 1, 1993 - August 1, 1993. National Aeronautics and Space Administration, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

United States. National Aeronautics and Space Administration., ed. Development, refinement and testing of a short term solar flare pR[sic]ediction algorithm: Progress report, August 1992 - February, 1993. National Aeronautics and Space Administration, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dapporto, Paolo, Paola Paoli, Patrizia Rossi, and Annalisa Guerri. The UTN program. Firenze University Press, 2001. http://dx.doi.org/10.36253/88-8453-032-6.

Full text
Abstract:
We give an algorithm which goal is to find the energy barrier between a given pair of points in a graph which represents the conformational space of a molecule. If the conformational space is homeomorphic to an -dimensional torus, then the graph can be chosen of a particular form. The UTN software, which implements the algorithm in this case, is described in detail. Finally we focus on applications: to show how UTN works, some examples are carried on in detail, with the additional support of graphical animation1 in the twodimensional case. The source code of the program and some data of the ex
APA, Harvard, Vancouver, ISO, and other styles
8

Burstein, Joseph. Exact numerical solutions of nonlinear differential equations, short algorithms: After three centuries of approximate methods. Metrics Press, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

John F. Kennedy Space Center., ed. Development of algorithms and error analyses for the short baseline lightning detection and ranging system. National Aeronautics and Space Administration, John F. Kennedy Space Center, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

John F. Kennedy Space Center., ed. Development of algorithms and error analyses for the short baseline lightning detection and ranging system. National Aeronautics and Space Administration, John F. Kennedy Space Center, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Shor algoritmi"

1

LaPierre, Ray. "Shor Algorithm." In The Materials Research Society Series. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-69318-3_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dierl, Simon, Paul Fiterau-Brostean, Falk Howar, Bengt Jonsson, Konstantinos Sagonas, and Fredrik Tåquist. "Scalable Tree-based Register Automata Learning." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57249-4_5.

Full text
Abstract:
AbstractExisting active automata learning (AAL) algorithms have demonstrated their potential in capturing the behavior of complex systems (e.g., in analyzing network protocol implementations). The most widely used AAL algorithms generate finite state machine models, such as Mealy machines. For many analysis tasks, however, it is crucial to generate richer classes of models that also show how relations between data parameters affect system behavior. Such models have shown potential to uncover critical bugs, but their learning algorithms do not scale beyond small and well curated experiments. In
APA, Harvard, Vancouver, ISO, and other styles
3

Brucker, Peter. "Shop Scheduling Problems." In Scheduling Algorithms. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24804-0_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Brucker, Peter. "Shop Scheduling Problems." In Scheduling Algorithms. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04550-3_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brucker, Peter. "Shop Scheduling Problems." In Scheduling Algorithms. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/978-3-662-03612-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Brucker, Peter. "Shop Scheduling Problems." In Scheduling Algorithms. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-662-03088-2_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bagchi, Tapan P. "Job Shop Scheduling." In Multiobjective Scheduling by Genetic Algorithms. Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5237-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhang, Han, Qing Li, and Xin Yao. "Knowledge-Guided Optimization for Complex Vehicle Routing with 3D Loading Constraints." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-70055-2_9.

Full text
Abstract:
AbstractThe split delivery vehicle routing problem with three-dimensional loading constraints (3L-SDVRP) intertwines complex routing and packing challenges. The current study addresses 3L-SDVRP using intelligent optimization algorithms, which iteratively evolve towards optimal solutions. A pivotal aspect of these algorithms is search operators that determine the search direction and the search step size. Effective operators significantly improve algorithmic performance. Traditional operators like swap, shift, and 2-opt fall short in complex scenarios like 3L-SDVRP, mainly due to their limited
APA, Harvard, Vancouver, ISO, and other styles
9

Mattfeld, Dirk C. "Evolutionary Algorithms." In Evolutionary Search and the Job Shop. Physica-Verlag HD, 1996. http://dx.doi.org/10.1007/978-3-662-11712-5_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bläser, Markus, and Bodo Siebert. "Computing Cycle Covers without Short Cycles." In Algorithms — ESA 2001. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44676-1_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Shor algoritmi"

1

J, Sathyaraj, and Sankardoss V. "Short-Term Wind Speed Forecasting using Long Shot-Term Memory Algorithms." In 2024 3rd International Conference on Automation, Computing and Renewable Systems (ICACRS). IEEE, 2024. https://doi.org/10.1109/icacrs62842.2024.10841597.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Leble, Vladimir, and George Barakos. "Coupled NS/SPH Analysis of Off-Shore Wind Turbine." In Vertical Flight Society 71st Annual Forum & Technology Display. The Vertical Flight Society, 2015. http://dx.doi.org/10.4050/f-0071-2015-10303.

Full text
Abstract:
This paper presents results of numerical computations for floating off-shore wind turbines (FOWTs) using, as an example, a machine of 10-MW rated power. The aerodynamic loads on the rotor are computed by the Helicopter Multi-Block (HMB2) flow solver developed at University of Liverpool. HMB2 solves the Navier-Stokes equations in integral form using the arbitrary Lagrangian-Eulerian formulation for time-dependent domains with moving boundaries. Hydrodynamic loads on the support platform are computed using the Smoothed Particle Hydrodynamics (SPH) method, which is mesh-free and represents the wa
APA, Harvard, Vancouver, ISO, and other styles
3

Maknickienė, Nijolė, and Kristina Miškinytė. "SKAITMENINIŲ VALIUTŲ KAINŲ PROGNOZAVIMAS NAUDOJANT GILIOJO MOKYMOSI ALGORITMĄ." In 23rd Conference for Young Researchers "Economics and Management". Vilnius Gediminas Technical University, 2020. http://dx.doi.org/10.3846/vvf.2020.033.

Full text
Abstract:
Kriptovaliutos vis dar yra finansų rinkos naujovė ir iki galo neištirta finansinis instrumentas. Tai išlaiko kriptovaliutas įdomia ir aktualia tema, tiek mokslininkams, tiek reguliacinėms institucijoms bei investuotojams. Kriptovaliutų rinka yra auganti, nestabili ir nuolat besikeičianti, kas suteikia jai aukštą riziką ir plačias galimybes. Finansinis išmanymas ir toliaregiškas prognozavimas, nepasimetant pinigų vertės, rizikos ir nenuspėjamumo chaose yra ypač svarbus šiandieninėje ekonomikoje. Sudėtingas kriptovaliutų rinkos pobūdis reikalauja plataus profilio duomenų kiekio, kuriam apdoroti
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Chengxi, Peng Cheng, and Chris Cheng. "A Comparison of Machine Learning Algorithms for Rate of Penetration Prediction for Directional Wells." In Middle East Oil, Gas and Geosciences Show. SPE, 2023. http://dx.doi.org/10.2118/213321-ms.

Full text
Abstract:
Abstract One of the biggest challenges facing oil and gas companies is to lower the cost of drilling operations. The most critical parameter affecting drilling cost is the rate of penetration (ROP). Improving the ROP and reducing the drilling cycle can be significant for companies to reduce drilling costs and risks, thus enhancing market competitiveness. In the present study, we evaluate the accuracy and effectiveness of different machine learning algorithms for directional wells. We collect many field drilling datasets such as bit type, bit drilling time, revolutions per minute (RPM), weight
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Xiangzeng, Longjun Zhang, Jiaxuan Song, et al. "AI-Assisted Automation of Well Type Selection and Pad Optimization During Well Placement in Yan'an Tight Gas Reservoir." In SPE Conference at Oman Petroleum & Energy Show. SPE, 2024. http://dx.doi.org/10.2118/218670-ms.

Full text
Abstract:
Abstract The Yan'an tight gas field, situated in the Ordos basin in central China, is emblematic of a typical tight gas reservoir. The field's development planning has been confronted with numerous challenges arising from conditions characterized by high geological heterogeneity, low porosity, multiple production formations, low lateral sand continuity, and a complex topography. Among the pivotal tasks in field development that necessitate addressing these challenges are the screening of well types and the optimization of pad locations. The judicious selection of well types, including horizont
APA, Harvard, Vancouver, ISO, and other styles
6

Alotaibi, Najd, and Serkan Dursun. "Vision Inspection of Power Lines with Deep Learning." In SPE Conference at Oman Petroleum & Energy Show. SPE, 2024. http://dx.doi.org/10.2118/218663-ms.

Full text
Abstract:
Abstract The purpose of this technical paper is to introduce a novel approach to inspecting power lines using computer vision and deep learning algorithms. Traditional inspection methods are often time-consuming and costly and can be dangerous for human inspectors. This paper presents a new workflow for power line inspection that leverages machine learning algorithms to automate the process. The proposed workflow for vision inspection of power lines involves capturing high-resolution images of power lines using drones or other unmanned vehicles. These images are then processed using a deep lea
APA, Harvard, Vancouver, ISO, and other styles
7

Tran, Tan D., Canh V. Pham, Dung T. K. Ha, and Phuong N. H. Pham. "Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/217.

Full text
Abstract:
This work proposes an efficient parallel algorithm for non-monotone submodular maximization under a knapsack constraint problem over the ground set of size n. Our algorithm improves the best approximation factor of the existing parallel one from 8 to 7 with O(log n) adaptive complexity. The key idea of our approach is to create an alternate threshold algorithmic framework. This new strategy alternately constructs two disjoint candidate solutions within a constant number of sequence rounds. Then, the algorithm boosts solution quality without sacrificing the adaptive complexity. Extensive experi
APA, Harvard, Vancouver, ISO, and other styles
8

Alqatari, Hala, Thierry-Laurent Tonellot, and Mohammed Mubarak. "Near-Borehole Imaging Using Full-Waveform Sonic Data." In SPE Middle East Oil & Gas Show and Conference. SPE, 2021. http://dx.doi.org/10.2118/204765-ms.

Full text
Abstract:
Abstract This work presents a full waveform sonic (FWS) dataset processing to generate high-resolution images of the near-borehole area. The dataset was acquired in a nearly horizontal well over a distance of 5400 feet. Multiple formation boundaries can be identified on the final image and tracked at up to 200 feet deep, along the wellbore's trajectory. We first present a new preprocessing sequence to prepare the sonic data for imaging. This sequence leverages denoising algorithms used in conventional surface seismic data processing to remove unwanted components of the recorded data that could
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Qinbin, Bingsheng He, and Dawn Song. "Practical One-Shot Federated Learning for Cross-Silo Setting." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/205.

Full text
Abstract:
Federated learning enables multiple parties to collaboratively learn a model without exchanging their data. While most existing federated learning algorithms need many rounds to converge, one-shot federated learning (i.e., federated learning with a single communication round) is a promising approach to make federated learning applicable in cross-silo setting in practice. However, existing one-shot algorithms only support specific models and do not provide any privacy guarantees, which significantly limit the applications in practice. In this paper, we propose a practical one-shot federated lea
APA, Harvard, Vancouver, ISO, and other styles
10

AlBahrani, Hussain, and Yara Alkhaldi. "An Algorithm for Consistent Mechanical Earth Model Parameters Determination: Applications in Wellbore Stability and Hydraulic Fracturing Modeling." In Middle East Oil, Gas and Geosciences Show. SPE, 2023. http://dx.doi.org/10.2118/213300-ms.

Full text
Abstract:
Abstract A mechanical earth models (MEM) is a crucial component of any well design process. Because it describes the subterranean formations in-situ stresses and rock mechanical properties, it is the main input into any geomechanics model. This means high impact issues like wellbore instability, drilling induced fractures, and hydraulic fracturing success probability are all directly dependent on the reliability of the provided MEM. Considering that MEM have been historically developed based on empirical correlations and an expert manual interpretations of logging data, intuitively, their accu
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Shor algoritmi"

1

Baader, Franz, Jan Hladik, and Rafael Peñaloza. PSpace Automata with Blocking for Description Logics. Aachen University of Technology, 2006. http://dx.doi.org/10.25368/2022.157.

Full text
Abstract:
In Description Logics (DLs), both tableau-based and automatabased algorithms are frequently used to show decidability and complexity results for basic inference problems such as satisfiability of concepts. Whereas tableau-based algorithms usually yield worst-case optimal algorithms in the case of PSpace-complete logics, it is often very hard to design optimal tableau-based algorithms for ExpTime-complete DLs. In contrast, the automata-based approach is usually well-suited to prove ExpTime upper-bounds, but its direct application will usually also yield an ExpTime-algorithm for a PSpace-complet
APA, Harvard, Vancouver, ISO, and other styles
2

Guliashki, Vassil, and Leoneed Kirilov. Algorithm Generating Initial Population of Schedules for Population-based Algorithms Solving Flexible Job Shop Problems. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, 2019. http://dx.doi.org/10.7546/crabs.2019.06.01.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cao, Zhengjun, Lihua Liu, and Andreas Christoforides. A Note on One Realization of a Scalable Shor Algorithm. Web of Open Science, 2020. http://dx.doi.org/10.37686/qrl.v1i2.81.

Full text
Abstract:
Very recently, Monz, et al. have reported the demonstration of factoring 15 using a scalable Shor algorithm with an ion-trap quantum computer. In this note, we remark that the report is somewhat misleading because there are three flaws in the proposed circuit diagram of Shor algorithm. We also remark that the principles behind the demonstration have not been explained properly, including its correctness and complexity.
APA, Harvard, Vancouver, ISO, and other styles
4

Asquith, Paul, Rebecca Oman, and Christopher Safaya. Short Sales and Trade Classification Algorithms. National Bureau of Economic Research, 2008. http://dx.doi.org/10.3386/w14158.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Plimpton, S. Fast parallel algorithms for short-range molecular dynamics. Office of Scientific and Technical Information (OSTI), 1993. http://dx.doi.org/10.2172/10176421.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Allende López, Marcos, Diego López, Sergio Cerón, et al. Quantum-Resistance in Blockchain Networks. Inter-American Development Bank, 2021. http://dx.doi.org/10.18235/0003313.

Full text
Abstract:
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Cambridge Quantum Computing (CQC), and Tecnológico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH
APA, Harvard, Vancouver, ISO, and other styles
7

Jones, Peter W., Andrei Osipov, and Vladimir Rokhlin. A Randomized Approximate Nearest Neighbors Algorithm - A Short Version. Defense Technical Information Center, 2011. http://dx.doi.org/10.21236/ada639824.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Baader, Franz, Oliver Fernández Gil, and Barbara Morawska. Hybrid Unification in the Description Logic EL. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.197.

Full text
Abstract:
Unification in Description Logics (DLs) has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. For the DL EL, which is used to define several large biomedical ontologies, unification is NP-complete. However, the unification algorithms for EL developed until recently could not deal with ontologies containing general concept inclusions (GCIs). In a series of recent papers we have made some progress towards addressing this problem, but the ontologies the developed unification algorithms can deal with need to satisfy a certain cycle restricti
APA, Harvard, Vancouver, ISO, and other styles
9

Borgwardt, Stefan, Walter Forkel, and Alisa Kovtunova. Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes. Technische Universität Dresden, 2019. http://dx.doi.org/10.25368/2023.223.

Full text
Abstract:
Lightweight temporal ontology languages have become a very active field of research in recent years. Many real-world applications, like processing electronic health records (EHRs), inherently contain a temporal dimension, and require efficient reasoning algorithms. Moreover, since medical data is not recorded on a regular basis, reasoners must deal with sparse data with potentially large temporal gaps. In this paper, we introduce a temporal extension of the tractable language ELH⊥, which features a new class of convex diamond operators that can be used to bridge temporal gaps. We develop a com
APA, Harvard, Vancouver, ISO, and other styles
10

Cable, S., T. Tajima, and K. Umegaki. Particle simulation algorithms with short-range forces in MHD and fluid flow. Office of Scientific and Technical Information (OSTI), 1992. http://dx.doi.org/10.2172/6970874.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Shor algoritmi' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography