default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbdesslem Layeb
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Abdesslem Layeb
:
Differential evolution algorithms with novel mutations, adaptive parameters, and Weibull flight operator. Soft Comput. 28(11-12): 7039-7091 (2024)- 2023
- [j22]Hari Mohan Pandey, Abdesslem Layeb, David Windridge:
Special Issue on Quantum Inspired Neural Networks for Engineering Optimization. Neural Process. Lett. 55(4): 3811-3812 (2023) - [i6]Abdesslem Layeb:
CKmeans and FCKmeans : Two deterministic initialization procedures for Kmeans algorithm using a modified crowding distance. CoRR abs/2304.09989 (2023) - [i5]Abdesslem Layeb:
Trochoid Search Optimization. CoRR abs/2312.13597 (2023) - 2022
- [j21]Abdesslem Layeb:
Tangent search algorithm for solving optimization problems. Neural Comput. Appl. 34(11): 8853-8884 (2022) - [i4]Abdesslem Layeb:
New hard benchmark functions for global optimization. CoRR abs/2202.04606 (2022) - 2021
- [j20]Khadoudja Ghanem, Abdesslem Layeb:
Feature Selection and Knapsack Problem Resolution Based on a Discrete Backtracking Optimization Algorithm. Int. J. Appl. Evol. Comput. 12(2): 1-15 (2021) - [j19]Rabah Lebsir, Abdesslem Layeb, Fariza Tahi:
A Greedy Clustering Algorithm for Multiple Sequence Alignment. Int. J. Cogn. Informatics Nat. Intell. 15(4): 1-17 (2021) - [i3]Abdesslem Layeb:
The Tangent Search Algorithm for Solving Optimization Problems. CoRR abs/2104.02559 (2021) - [i2]Abdesslem Layeb:
Two novel feature selection algorithms based on crowding distance. CoRR abs/2105.05212 (2021) - 2020
- [j18]Souheila Benkhaira, Abdesslem Layeb:
Face Recognition Using RLDA Method Based on Mutated Cuckoo Search Algorithm to Extract Optimal Features. Int. J. Appl. Metaheuristic Comput. 11(2): 118-133 (2020) - [j17]Abir Derouiche, Abdesslem Layeb, Zineb Habbas:
Metaheuristics Guided by the Apriori Principle for Association Rule Mining: Case Study - CRO Metaheuristic. Int. J. Organ. Collect. Intell. 10(3): 14-37 (2020) - [c13]Abir Derouiche, Abdesslem Layeb, Zineb Habbas:
Mining Interesting Association Rules with a Modified Genetic Algorithm. MedPRAI 2020: 274-285
2010 – 2019
- 2019
- [c12]Naima Saidi, Abdesslem Layeb:
A hybrid Chemical Reaction Optimisation Algorithm For Solving The DNA Fragment Assembly Problem. CITSC 2019: 41-50 - 2018
- [j16]Imene Ferdi, Abdesslem Layeb:
A GRASP algorithm based new heuristic for the capacitated location routing problem. J. Exp. Theor. Artif. Intell. 30(3): 369-387 (2018) - [c11]Abir Derouiche, Abdesslem Layeb, Zineb Habbas:
Frequent Itemsets Mining with Chemical Reaction Optimization Metaheuristic. PAIS 2018: 1-6 - 2017
- [j15]Badis Bensedira, Abdesslem Layeb, Zineb Habbas:
Discrete cuckoo search applied to capacitated arc routing problem. Int. J. Metaheuristics 6(1/2): 37-54 (2017) - [c10]Abir Derouiche, Abdesslem Layeb, Zineb Habbas:
Chemical Reaction Optimization Metaheuristic for Solving Association Rule Mining Problem. AICCSA 2017: 1011-1018 - 2016
- [c9]Imene Ferdi, Abdesslem Layeb:
A Novel Heuristic Based Simulated Annealing for the Capacitated Location Routing Problem. MedPRAI 2016: 17-24 - 2015
- [j14]Halima Djelloul, Abdesslem Layeb, Salim Chikhi:
Quantum inspired cuckoo search algorithm for graph colouring problem. Int. J. Bio Inspired Comput. 7(3): 183-194 (2015) - [j13]Abdesslem Layeb:
Two Novel Heuristics Based on a New Density Measure for Vehicle Routing Problem. Int. J. Oper. Res. Inf. Syst. 6(1): 78-90 (2015) - 2014
- [j12]Halima Djelloul, Abdesslem Layeb, Salim Chikhi:
A Binary Cuckoo Search Algorithm for Graph Coloring Problem. Int. J. Appl. Evol. Comput. 5(3): 42-56 (2014) - [j11]Abdesslem Layeb, Salim Chikhi:
Two novel sweep-based heuristics for the vehicle routing problem. Int. J. Comput. Appl. Technol. 49(3/4): 263-269 (2014) - [j10]Abdesslem Layeb, Zeyneb Benayad:
A Novel Firefly Algorithm Based Ant Colony Optimization for Solving Combinatorial Optimization Problems. Int. J. Comput. Sci. Appl. 11(2): 19-37 (2014) - [j9]Abdesslem Layeb, Serial Rayene Boussalia:
A novel greedy quantum inspired cuckoo search algorithm for variable sized bin packing problem. Int. J. Math. Oper. Res. 6(6): 732-751 (2014) - [j8]Widad Kartous, Abdesslem Layeb, Salim Chikhi:
A New Quantum Cuckoo Search Algorithm for Multiple Sequence Alignment. J. Intell. Syst. 23(3): 261-275 (2014) - 2013
- [j7]Abdesslem Layeb, Meryem Ammi, Salim Chikhi:
A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem. J. Comput. Inf. Technol. 21(1): 37-48 (2013) - [j6]Abdesslem Layeb, Marwa Selmane, Maroua Bencheikh Elhoucine:
A new greedy randomised adaptive search procedure for multiple sequence alignment. Int. J. Bioinform. Res. Appl. 9(4): 323-335 (2013) - [j5]Abdesslem Layeb:
A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems. J. Comput. Appl. Math. 253: 14-25 (2013) - [i1]Abdesslem Layeb, Amira Boudra, Wissem Korichi, Salim Chikhi:
A new greedy randomized adaptive search procedure for multiobjective RNA structural alignment. CoRR abs/1302.1400 (2013) - 2012
- [j4]Amira Gherboudj, Abdesslem Layeb, Salim Chikhi:
Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm. Int. J. Bio Inspired Comput. 4(4): 229-236 (2012) - 2011
- [j3]Abdesslem Layeb:
A novel quantum inspired cuckoo search for knapsack problems. Int. J. Bio Inspired Comput. 3(5): 297-305 (2011) - 2010
- [j2]Abdesslem Layeb, Djamel-Eddine Saïdouni:
A New Quantum Evolutionary Algorithm with Sifting Strategy for Binary Decision Diagram Ordering Problem. Int. J. Cogn. Informatics Nat. Intell. 4(4): 47-61 (2010) - [j1]Abdesslem Layeb:
A Quantum Inspired Particle Swarm Algorithm for Solving the Maximum Satisfiability Problem. Int. J. Comb. Optim. Probl. Informatics 1(1): 13-23 (2010) - [c8]Abdesslem Layeb, Abdel Hakim Deneche, Souham Meshoul:
A New Artificial Immune System for Solving the Maximum Satisfiability Problem. IEA/AIE (2) 2010: 136-142
2000 – 2009
- 2009
- [c7]Abdesslem Layeb, Souham Meshoul, Mohamed Batouche:
A Hybrid method for effective multiple sequence alignment. ISCC 2009: 970-975 - 2008
- [c6]Abdesslem Layeb, Souham Meshoul, Mohamed Batouche:
Quantum Genetic Algorithm for Multiple RNA Structural Alignment. Asia International Conference on Modelling and Simulation 2008: 873-878 - [c5]Abdesslem Layeb, Djamel-Eddine Saïdouni:
Quantum Differential Evolution Algorithm for Variable Ordering Problem of Binary Decision Diagram. CSICC 2008: 942-945 - [c4]Abdesslem Layeb, Djamel-Eddine Saïdouni:
A New Quantum Evolutionary Local Search Algorithm for MAX 3-SAT Problem. HAIS 2008: 172-179 - 2007
- [c3]Abdesslem Layeb, Abdel Hakim Deneche:
Multiple Sequence Alignment by Immune Artificial System. AICCSA 2007: 336-342 - 2006
- [c2]Abdesslem Layeb, Soham Meshoul, Mohamed Batouche:
Multiple sequence alignment by quantum genetic algorithm. IPDPS 2006 - 2005
- [c1]Souham Meshoul, Abdesslem Layeb, Mohamed Batouche:
A Quantum Evolutionary Algorithm for Effective Multiple Sequence Alignment. EPIA 2005: 260-271
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
