![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Maha Elarbi
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Safa Mahouachi, Maha Elarbi, Khaled Sethom, Slim Bechikh, Carlos A. Coello Coello:
A Bi-Level Evolutionary Model Tree Induction Approach for Regression. CEC 2024: 1-9 - 2023
- [j9]Rihab Said
, Maha Elarbi
, Slim Bechikh
, Carlos Artemio Coello Coello
, Lamjed Ben Said
:
Discretization-Based Feature Selection as a Bilevel Optimization Problem. IEEE Trans. Evol. Comput. 27(4): 893-907 (2023) - 2022
- [j8]Sofien Boutaib
, Maha Elarbi, Slim Bechikh
, Carlos A. Coello Coello, Lamjed Ben Said:
Uncertainty-wise software anti-patterns detection: A possibilistic evolutionary machine learning approach. Appl. Soft Comput. 129: 109620 (2022) - [j7]Sofien Boutaib
, Maha Elarbi, Slim Bechikh, Fabio Palomba, Lamjed Ben Said:
Handling uncertainty in SBSE: a possibilistic evolutionary approach for code smells detection. Empir. Softw. Eng. 27(6): 124 (2022) - [j6]Maha Elarbi, Chaima Elwadi, Slim Bechikh
, Zied Bahroun, Lamjed Ben Said:
An Evolutionary Multi-objective Approach for Coordinating Supplier-Producer Conflict in Lot Sizing. Int. J. Inf. Technol. Decis. Mak. 21(2): 541-575 (2022) - [j5]Rihab Said
, Maha Elarbi, Slim Bechikh, Lamjed Ben Said:
Solving combinatorial bi-level optimization problems using multiple populations and migration schemes. Oper. Res. 22(3): 1697-1735 (2022) - [c10]Rihab Said
, Maha Elarbi, Slim Bechikh, Carlos A. Coello Coello, Lamjed Ben Said:
Interval-based Cost-sensitive Classification Tree Induction as a Bi-level Optimization Problem. CEC 2022: 1-8 - [c9]Rihab Said
, Maha Elarbi, Slim Bechikh, Carlos A. Coello Coello, Lamjed Ben Said:
Cost-sensitive classification tree induction as a bi-level optimization problem. GECCO Companion 2022: 284-287 - [c8]Sofien Boutaib, Maha Elarbi, Slim Bechikh, Fabio Palomba, Lamjed Ben Said:
A bi-level evolutionary approach for the multi-label detection of smelly classes. GECCO Companion 2022: 782-785 - 2021
- [j4]Sofien Boutaib
, Slim Bechikh, Fabio Palomba, Maha Elarbi, Mohamed Makhlouf, Lamjed Ben Said:
Code smell detection and identification in imbalanced environments. Expert Syst. Appl. 166: 114076 (2021) - [j3]Maha Elarbi
, Slim Bechikh
, Lamjed Ben Said
:
On the importance of isolated infeasible solutions in the many-objective constrained NSGA-III. Knowl. Based Syst. 227: 104335 (2021) - [c7]Sofien Boutaib
, Maha Elarbi
, Slim Bechikh
, Chih-Cheng Hung
, Lamjed Ben Said
:
Software Anti-patterns Detection Under Uncertainty Using a Possibilistic Evolutionary Approach. EuroGP 2021: 181-197 - [c6]Sofien Boutaib, Maha Elarbi, Slim Bechikh, Mohamed Makhlouf, Lamjed Ben Said:
Dealing with Label Uncertainty in Web Service Anti-patterns Detection using a Possibilistic Evolutionary Approach. ICWS 2021: 347-357 - [c5]Sofien Boutaib, Maha Elarbi, Slim Bechikh, Fabio Palomba, Lamjed Ben Said:
A Possibilistic Evolutionary Approach to Handle the Uncertainty of Software Metrics Thresholds in Code Smells Detection. QRS 2021: 574-585 - 2020
- [j2]Maha Elarbi
, Slim Bechikh
, Carlos A. Coello Coello
, Mohamed Makhlouf, Lamjed Ben Said
:
Approximating Complex Pareto Fronts With Predefined Normal-Boundary Intersection Directions. IEEE Trans. Evol. Comput. 24(5): 809-823 (2020)
2010 – 2019
- 2019
- [c4]Slim Bechikh, Maha Elarbi
, Chih-Cheng Hung, Sabrine Hamdi, Lamjed Ben Said
:
A Hybrid Evolutionary Algorithm with Heuristic Mutation for Multi-objective Bi-clustering. CEC 2019: 2323-2330 - 2018
- [j1]Maha Elarbi
, Slim Bechikh
, Abhishek Gupta
, Lamjed Ben Said
, Yew-Soon Ong
:
A New Decomposition-Based NSGA-II for Many-Objective Optimization. IEEE Trans. Syst. Man Cybern. Syst. 48(7): 1191-1210 (2018) - 2017
- [c3]Chedi Abdelkarim, Lilia Rejeb
, Lamjed Ben Said, Maha Elarbi
:
Evidential learning classifier system. GECCO (Companion) 2017: 123-124 - [c2]Maha Elarbi
, Slim Bechikh
, Lamjed Ben Said
:
On the importance of isolated solutions in constrained decomposition-based many-objective optimization. GECCO 2017: 561-568 - [p3]Maha Elarbi
, Slim Bechikh
, Lamjed Ben Said
, Rituparna Datta:
Multi-objective Optimization: Classical and Evolutionary Approaches. Recent Advances in Evolutionary Multi-objective Optimization 2017: 1-30 - [p2]Slim Bechikh
, Maha Elarbi
, Lamjed Ben Said
:
Many-objective Optimization Using Evolutionary Algorithms: A Survey. Recent Advances in Evolutionary Multi-objective Optimization 2017: 105-137 - [p1]Arun Kumar Sharma
, Rituparna Datta, Maha Elarbi
, Bishakh Bhattacharya
, Slim Bechikh
:
Practical Applications in Constrained Evolutionary Multi-objective Optimization. Recent Advances in Evolutionary Multi-objective Optimization 2017: 159-179 - 2016
- [c1]Maha Elarbi
, Slim Bechikh
, Lamjed Ben Said
, Chih-Cheng Hung:
Solving many-objective problems using targeted search directions. SAC 2016: 89-96
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-21 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint