Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Parfait Atchade-Adelomou"'
Publikováno v:
Mathematics, Vol 10, Iss 3, p 416 (2022)
We propose a new Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Travelling Salesman Problem (TSP), with which we overcame the best formulation of the Vehicle Routing Problem (VRP) in terms of the minimum number of necessary var
Externí odkaz:
https://doaj.org/article/bd22b81bfdff4036b3937113859883c6
Publikováno v:
Algorithms, Vol 14, Iss 7, p 194 (2021)
This article aims to bring quantum computing to robotics. A quantum algorithm is developed to minimize the distance traveled in warehouses and distribution centers where order picking is applied. For this, a proof of concept is proposed through a Ras
Externí odkaz:
https://doaj.org/article/0adb6a0b79da498eb67e18108af30737
Autor:
Parfait Atchade Adelomou, Daniel Casado Fauli, Elisabet Golobardes Ribé, Xavier Vilasís-Cardona
Publikováno v:
Artificial Intelligence Review. 56:2639-2665
Case-Based Reasoning (CBR) is an artificial intelligence approach to problem-solving with a good record of success. This article proposes using Quantum Computing to improve some of the key processes of CBR, such that a Quantum Case-Based Reasoning (q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc8c3b76ff361290585f2c40690f9599
https://doi.org/10.1007/s10462-022-10238-w
https://doi.org/10.1007/s10462-022-10238-w
Publikováno v:
Soft Computing. 26:7167-7174
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad9fe9ecf4fcda15fb4b86a4e904eced
https://doi.org/10.1007/s00500-022-07190-w
https://doi.org/10.1007/s00500-022-07190-w
We propose a new binary formulation of the Travelling Salesman Problem (TSP), with which we overcame the best formulation of the Vehicle Routing Problem (VRP) in terms of the minimum number of necessary variables. Furthermore, we present a detailed s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e72f41a570b3550dbc0763ea2cdea42b
https://doi.org/10.20944/preprints202112.0316.v1
https://doi.org/10.20944/preprints202112.0316.v1
Publikováno v:
Mathematics; Volume 10; Issue 3; Pages: 416
Mathematics, Vol 10, Iss 416, p 416 (2022)
Mathematics, Vol 10, Iss 416, p 416 (2022)
We propose a new Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Travelling Salesman Problem (TSP), with which we overcame the best formulation of the Vehicle Routing Problem (VRP) in terms of the minimum number of necessary var
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::15539ee3a3476ec93f13217b75442472
http://arxiv.org/abs/2110.12158
http://arxiv.org/abs/2110.12158
Convolutional Neural Networks (CNN) are used mainly to treat problems with many images characteristic of Deep Learning. In this work, we propose a hybrid image classification model to take advantage of quantum and classical computing. The method will
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9fdbb7601beecbf2195029c7520148c
https://doi.org/10.21203/rs.3.rs-405334/v1
https://doi.org/10.21203/rs.3.rs-405334/v1
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030617042
HAIS
HAIS
The scheduling problem of social workers is a class of combinatorial optimization problems that can be solved in exponential time at best. Because is belongs to class of problems known as NP-Hard, which have huge impact huge impact on our society. No
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cab190f0aa5ebaaa47ba07163a9ac1bf
https://doi.org/10.1007/978-3-030-61705-9_21
https://doi.org/10.1007/978-3-030-61705-9_21