Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Laurent Moalic"'
A Survey of Artificial Intelligence Based WSNs Deployment Techniques and Related Objectives Modeling
Autor:
Khaoula Zaimen, Mohamed-El-Amine Brahmia, Laurent Moalic, Abdelhafid Abouaissa, Lhassane Idoumghar
Publikováno v:
IEEE Access, Vol 10, Pp 113294-113329 (2022)
Recent advances in hardware and communication technologies have accelerated the deployment of billions of wireless sensors. This transformation has created a wide range of applications adapted to the evolving trends of our daily life requirements. Wi
Externí odkaz:
https://doaj.org/article/7a7cc3106d5546cd9ae32ef599b3e809
Publikováno v:
Journal of Modern Transportation, Vol 26, Iss 4, Pp 297-314 (2018)
Abstract In this paper, we present a multiobjective approach for solving the one-way car relocation problem. We fix three objectives that include the number of remaining rejected demands, the number of jockeys used for the relocation operations, and
Externí odkaz:
https://doaj.org/article/55747a308846437cad760852602c1746
Publikováno v:
ACM Journal of Experimental Algorithmics. 27:1-23
The aim of the “CG:SHOP Challenge 2019” was to generate optimal area polygonizations of a planar point set. We describe here the algorithm that won the challenge. It is a two-phase algorithm based on the node-insertion move technique, which comes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9236f236c3d3adfc131fab3dd47aeee0
https://doi.org/10.1145/3503953
https://doi.org/10.1145/3503953
Autor:
Ghazaleh Khodabandelou, Mehdi Katranji, Alexandre Caminada, Sami Kraiem, Laurent Moalic, Fouad Hadj Selem, Guilhem Sanmarty
Publikováno v:
Data Mining and Knowledge Discovery. 34:201-230
Rapid urbanization has made the estimation of the human mobility flows a substantial task for transportation and urban planners. Worker and student mobility flows are among the most weekly regular displacements and consequently generate road congesti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0319c1aaee6d4be454158b515129e53
https://doi.org/10.1007/s10618-019-00662-y
https://doi.org/10.1007/s10618-019-00662-y
Autor:
Jean-Francois Dollinger, Khaoula Zaimen, Lhassane Idoumghar, Abdelhafid Abouaissa, Laurent Moalic, Mohamed-el-Amine Brahmia
Publikováno v:
Advances in Model and Data Engineering in the Digitalization Era ISBN: 9783030876562
MEDI Workshops
MEDI Workshops
Coverage area maximization is a crucial issue that must be considered in Wireless sensor network (WSN) deployment as long as it impacts the sensor network efficiency. In this paper, a novel approach based on particle swarm optimization (PSO) and voro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e65ec451da626084918b88080448658
https://doi.org/10.1007/978-3-030-87657-9_7
https://doi.org/10.1007/978-3-030-87657-9_7
Autor:
Lhassane Idoumghar, Jean-Francois Dollinger, Khaoula Zaimen, Mohamed-el-Amine Brahmia, Abdelhafid Abouaissa, Laurent Moalic
Publikováno v:
IoTSMS
The rapid growing of Internet of things (IoT) is one of the most important factors of integrating WSN in smart buildings. Furthermore, the presence of these sensors and technologies allow improving the accuracy of the measured data while reducing bui
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebb99ef8fb43564abbb05d11bdee3bc5
https://doi.org/10.1109/iotsms52051.2020.9340226
https://doi.org/10.1109/iotsms52051.2020.9340226
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030535513
LION
LION
The Unicost Set Covering Problem (USCP) is a well-known \(\mathcal {NP}\)-hard combinatorial optimization problem. This paper presents a memetic algorithm that combines and adapts the Hybrid Evolutionary Algorithm in Duet (HEAD) and the Row Weighting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b3896c39435b0192d6e2082ffa54940
https://doi.org/10.1007/978-3-030-53552-0_23
https://doi.org/10.1007/978-3-030-53552-0_23
Publikováno v:
Computers and Operations Research
Computers and Operations Research, Elsevier, 2017, 78, pp.420-430. ⟨10.1016/j.cor.2015.11.010⟩
Computers and Operations Research, Elsevier, 2017, 78, pp.420-430. ⟨10.1016/j.cor.2015.11.010⟩
Computing the optimal route to go from one place to another is a highly important issue in road networks. The problem consists of finding the path that minimizes a metric such as distance, time, cost etc. to go from one node to another in a directed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b3131b5fe9280abe603162bc3c98551
https://doi.org/10.1016/j.cor.2015.11.010
https://doi.org/10.1016/j.cor.2015.11.010
Publikováno v:
Transportation Research Procedia. 22:134-143
Route planning in urban public transport systems constitutes a common decision problem faced by travelers. Therefore, building Advanced Traveler Information Systems (ATIS) that provide passengers with pre-trip information on navigating through the ne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b25ad2a74884548349d186819f951f6
https://doi.org/10.1016/j.trpro.2017.03.020
https://doi.org/10.1016/j.trpro.2017.03.020
Autor:
Laurent Moalic, Alexandre Gondran
Publikováno v:
CEC
CEC 2019 IEEE Congress on Evolutionary Computation
CEC 2019 IEEE Congress on Evolutionary Computation, Jun 2019, Wellington, New Zealand. pp.1798-1805
HAL
CEC 2019 IEEE Congress on Evolutionary Computation
CEC 2019 IEEE Congress on Evolutionary Computation, Jun 2019, Wellington, New Zealand. pp.1798-1805
HAL
Let G be a graph, for which each vertex is assigned one of k colors in {1, …, k}. A legal coloring requires that two adjacent vertices have two different colors. The minimum sum coloring problem (MSCP) consists of finding such a legal coloring with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e635c187965dd58f168ea0ec9643a65
https://doi.org/10.1109/cec.2019.8789927
https://doi.org/10.1109/cec.2019.8789927