Abdesslem Layeb

Orcid: 0000-0002-6553-8253

According to our database1, Abdesslem Layeb authored at least 40 papers between 2005 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Special Issue on Quantum Inspired Neural Networks for Engineering Optimization.
Neural Process. Lett., 2023

Trochoid Search Optimization.
CoRR, 2023

CKmeans and FCKmeans : Two deterministic initialization procedures for Kmeans algorithm using a modified crowding distance.
CoRR, 2023

2022
Tangent search algorithm for solving optimization problems.
Neural Comput. Appl., 2022

New hard benchmark functions for global optimization.
CoRR, 2022

2021
A Greedy Clustering Algorithm for Multiple Sequence Alignment.
Int. J. Cogn. Informatics Nat. Intell., 2021

Feature Selection and Knapsack Problem Resolution Based on a Discrete Backtracking Optimization Algorithm.
Int. J. Appl. Evol. Comput., 2021

Two novel feature selection algorithms based on crowding distance.
CoRR, 2021

2020
Metaheuristics Guided by the Apriori Principle for Association Rule Mining: Case Study - CRO Metaheuristic.
Int. J. Organ. Collect. Intell., 2020

Face Recognition Using RLDA Method Based on Mutated Cuckoo Search Algorithm to Extract Optimal Features.
Int. J. Appl. Metaheuristic Comput., 2020

Mining Interesting Association Rules with a Modified Genetic Algorithm.
Proceedings of the Pattern Recognition and Artificial Intelligence, 2020

2019
A hybrid Chemical Reaction Optimisation Algorithm For Solving The DNA Fragment Assembly Problem.
Proceedings of the 1st International Conference on Innovative Trends in Computer Science, 2019

2018
A GRASP algorithm based new heuristic for the capacitated location routing problem.
J. Exp. Theor. Artif. Intell., 2018

Frequent Itemsets Mining with Chemical Reaction Optimization Metaheuristic.
Proceedings of the 2018 3rd International Conference on Pattern Analysis and Intelligent Systems (PAIS), 2018

2017
Discrete cuckoo search applied to capacitated arc routing problem.
Int. J. Metaheuristics, 2017

Chemical Reaction Optimization Metaheuristic for Solving Association Rule Mining Problem.
Proceedings of the 14th IEEE/ACS International Conference on Computer Systems and Applications, 2017

2016
A Novel Heuristic Based Simulated Annealing for the Capacitated Location Routing Problem.
Proceedings of the Mediterranean Conference on Pattern Recognition and Artificial Intelligence, 2016

2015
Two Novel Heuristics Based on a New Density Measure for Vehicle Routing Problem.
Int. J. Oper. Res. Inf. Syst., 2015

Quantum inspired cuckoo search algorithm for graph colouring problem.
Int. J. Bio Inspired Comput., 2015

2014
A New Quantum Cuckoo Search Algorithm for Multiple Sequence Alignment.
J. Intell. Syst., 2014

A novel greedy quantum inspired cuckoo search algorithm for variable sized bin packing problem.
Int. J. Math. Oper. Res., 2014

A Novel Firefly Algorithm Based Ant Colony Optimization for Solving Combinatorial Optimization Problems.
Int. J. Comput. Sci. Appl., 2014

Two novel sweep-based heuristics for the vehicle routing problem.
Int. J. Comput. Appl. Technol., 2014

A Binary Cuckoo Search Algorithm for Graph Coloring Problem.
Int. J. Appl. Evol. Comput., 2014

2013
A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems.
J. Comput. Appl. Math., 2013

A new greedy randomised adaptive search procedure for multiple sequence alignment.
Int. J. Bioinform. Res. Appl., 2013

A new greedy randomized adaptive search procedure for multiobjective RNA structural alignment
CoRR, 2013

A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem.
J. Comput. Inf. Technol., 2013

2012
Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm.
Int. J. Bio Inspired Comput., 2012

2011
A novel quantum inspired cuckoo search for knapsack problems.
Int. J. Bio Inspired Comput., 2011

2010
A Quantum Inspired Particle Swarm Algorithm for Solving the Maximum Satisfiability Problem.
Int. J. Comb. Optim. Probl. Informatics, 2010

A New Quantum Evolutionary Algorithm with Sifting Strategy for Binary Decision Diagram Ordering Problem.
Int. J. Cogn. Informatics Nat. Intell., 2010

A New Artificial Immune System for Solving the Maximum Satisfiability Problem.
Proceedings of the Trends in Applied Intelligent Systems, 2010

2009
A Hybrid method for effective multiple sequence alignment.
Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), 2009

2008
A New Quantum Evolutionary Local Search Algorithm for MAX 3-SAT Problem.
Proceedings of the Hybrid Artificial Intelligence Systems, Third International Workshop, 2008

Quantum Differential Evolution Algorithm for Variable Ordering Problem of Binary Decision Diagram.
Proceedings of the Advances in Computer Science and Engineering, 2008

Quantum Genetic Algorithm for Multiple RNA Structural Alignment.
Proceedings of the Second Asia International Conference on Modelling and Simulation, 2008

2007
Multiple Sequence Alignment by Immune Artificial System.
Proceedings of the 2007 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2007), 2007

2006
Multiple sequence alignment by quantum genetic algorithm.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005
A Quantum Evolutionary Algorithm for Effective Multiple Sequence Alignment.
Proceedings of the Progress in Artificial Intelligence, 2005


  Loading...