Maurice Clerc
Research Subjects
Maurice Clerc has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Mahamed Ghasib Hussein Omran
Department of Computer Science, Gulf University for Science & Technology, Hawally, Kuwait
6 shared publications - Patrick Siarry
Université Paris-Est Créteil
3 shared publications - Ayed Salman
Kuwait University
2 shared publications - Yann Cooren
Université de Paris 12
2 shared publications - Abbas El Dor
LiSSi (E.A. 3956)
1 shared publication - Ahmad Aldabagh
Computer Science Department, Gulf University for Science & Technology, Hawally 32093, Kuwait
1 shared publication
Latest Publications
- 28 August 2025
- Published by Springer Nature in Memetic Computing
- Vol. 17 (3) , 1-24
Ensemble of simple optimizers
- 28 August 2025
- Published by Springer Nature in Memetic Computing
- Vol. 17 (3) , 1-24
Ensemble of simple optimizers
- Open Access
Law of sines = Law of cosines
In a triangle, it is easy to show that the law of cosines implies the law of sines. The converse is scarcely documented, likely because published analyses have long regarded it as false. Three non-circular proofs are presented—two of which are new—showing that the law of sines implies the Pythagorean theorem. Since the latter can be used to prove the law of cosines, this is sufficient to conclude that, indirectly, the law of cosines is implied by the law of sines.
Open AccessLaw of sines = Law of cosines
In a triangle, it is easy to show that the law of cosines implies the law of sines. The converse is scarcely documented, likely because published analyses have long regarded it as false. Three non-circular proofs are presented—two of which are new—showing that the law of sines implies the Pythagorean theorem. Since the latter can be used to prove the law of cosines, this is sufficient to conclude that, indirectly, the law of cosines is implied by the law of sines.
- Open Access
Iterative optimization RCO: A "Ruler & Compass" deterministic method
We present here the basic version of an iterative optimization algorithm that is deterministic, needsjust one parameter, and often capable of finding a good solution after very few evaluations of the fitnessfunction. We explain its principles using a multimodal one-dimensional problem. For such problems, it couldbe applied using nothing more than a ruler and a compass. We provide classical examples illustrating thealgorithm’s properties, as well examples where it fails. As this version does not address possible stagnation,it is really only useful for low-dimensional problems (typically at most ten), where each evaluation of aposition in the search space is very costly in terms of computational resources.
Open AccessIterative optimization RCO: A "Ruler & Compass" deterministic method
We present here the basic version of an iterative optimization algorithm that is deterministic, needsjust one parameter, and often capable of finding a good solution after very few evaluations of the fitnessfunction. We explain its principles using a multimodal one-dimensional problem. For such problems, it couldbe applied using nothing more than a ruler and a compass. We provide classical examples illustrating thealgorithm’s properties, as well examples where it fails. As this version does not address possible stagnation,it is really only useful for low-dimensional problems (typically at most ten), where each evaluation of aposition in the search space is very costly in terms of computational resources.
- Open Access
Iterative optimization -Complexity and Efficiency are not antinomic
When we compare two algorithms, complexity and efficiency are often thought of as almost the same, implying that low complexity indicates good efficiency. However, these two concepts are actually distinct. We provide theoretical reasons and a few examples to demonstrate that an algorithm can be both more complex and more efficient than another at the same time. We also address several common misconceptions about iterative optimization. Problem size Time complexity - Thanks: To my colleague and friend Mohamed G. Omran for our fruitful discussions. Even though he doesn't agree with all my conclusions!
Open AccessIterative optimization -Complexity and Efficiency are not antinomic
When we compare two algorithms, complexity and efficiency are often thought of as almost the same, implying that low complexity indicates good efficiency. However, these two concepts are actually distinct. We provide theoretical reasons and a few examples to demonstrate that an algorithm can be both more complex and more efficient than another at the same time. We also address several common misconceptions about iterative optimization. Problem size Time complexity - Thanks: To my colleague and friend Mohamed G. Omran for our fruitful discussions. Even though he doesn't agree with all my conclusions!
- Open Access
A general quantum method to solve the graph K-colouring problem
Warning: I have to seriously modify it. Complicated and not efficient!
Open AccessA general quantum method to solve the graph K-colouring problem
Warning: I have to seriously modify it. Complicated and not efficient!
- 6 March 2023
- Published by Springer Nature in Neural Computing and Applications
- Vol. 35 (16) , 11807-11814
Laplace’s rule of succession: a simple and efficient way to compare metaheuristics
- 6 March 2023
- Published by Springer Nature in Neural Computing and Applications
- Vol. 35 (16) , 11807-11814
Laplace’s rule of succession: a simple and efficient way to compare metaheuristics
- Open Access
- 24 June 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (13) , 2219
Permutation Tests for Metaheuristic Algorithms
Many metaheuristic approaches are inherently stochastic. In order to compare such methods, statistical tests are needed. However, choosing an appropriate test is not trivial, given that each test has some assumptions about the distribution of the underlying data that must be true before it can be used. Permutation tests (P-Tests) are statistical tests with minimal number of assumptions. These tests are simple, intuitive and nonparametric. In this paper, we argue researchers in the field of metaheuristics to adopt P-Tests to compare their algorithms. We define two statistic tests and then present an algorithm that uses them to compute the p-value. The proposed process is used to compare 5 metaheuristic algorithms on 10 benchmark functions. The resulting p-values are compared with the p-values of two widely used statistical tests. The results show that the proposed P-test is generally consistent with the classical tests, but more conservative in few cases.
- 24 June 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (13) , 2219
Open AccessPermutation Tests for Metaheuristic Algorithms
Many metaheuristic approaches are inherently stochastic. In order to compare such methods, statistical tests are needed. However, choosing an appropriate test is not trivial, given that each test has some assumptions about the distribution of the underlying data that must be true before it can be used. Permutation tests (P-Tests) are statistical tests with minimal number of assumptions. These tests are simple, intuitive and nonparametric. In this paper, we argue researchers in the field of metaheuristics to adopt P-Tests to compare their algorithms. We define two statistic tests and then present an algorithm that uses them to compute the p-value. The proposed process is used to compare 5 metaheuristic algorithms on 10 benchmark functions. The resulting p-values are compared with the p-values of two widely used statistical tests. The results show that the proposed P-test is generally consistent with the classical tests, but more conservative in few cases.
- 1 January 2019
- Published by Springer Nature
- p. C1
Correction to: Swarm Intelligence
- 30 August 2017
- Published by Springer Nature in Applied Intelligence
- Vol. 48 (6) , 1596-1608
APS 9: an improved adaptive population-based simplex method for real-world engineering optimization problems
- 30 August 2017
- Published by Springer Nature in Applied Intelligence
- Vol. 48 (6) , 1596-1608
APS 9: an improved adaptive population-based simplex method for real-world engineering optimization problems