default search action
Menouar Boulif
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Nourredine Oukas
, Menouar Boulif
A novel fluid-based modeling approach using extended Hybrid Petri nets for power consumption monitoring in wireless autonomous IoT devices, with energy harvesting capability and triple sleeping strategy. Wirel. Networks 30(3): 1869-1892 (2024) - 2023
- [j6]Basma Alouane
Fuzzy constraint prioritization to solve heavily constrained problems with the genetic algorithm. Eng. Appl. Artif. Intell. 119: 105768 (2023) - [j5]Nourredine Oukas
A new generalized stochastic Petri net modeling for energy-harvesting-wireless sensor network assessment. Int. J. Commun. Syst. 36(11) (2023) - [c5]Nourredine Oukas, Menouar Boulif, Akli Abbas
Mitigating Jamming Attacks in IoT RF-Devices through Dynamic Channel Hopping: A Novel Petri-nets Formulation. ICCA 2023: 1-6 - [i5]Menouar Boulif
A new node-shift encoding representation for the travelling salesman problem. CoRR abs/2305.09257 (2023) - [i4]Ali Chaouche, Menouar Boulif
Edge-set reduction to efficiently solve the graph partitioning problem with the genetic algorithm. CoRR abs/2307.10410 (2023) - 2022
- [c4]Nourredine Oukas
A New GSPNs-Model for Sensors in Solar EHWSNs, Considering Seasonal Sunshine Levels and Sleeping Mechanism Based on Channel Polling Schedule. CSA 2022: 177-186 - [c3]Nourredine Oukas, Abderrezak Djouabri, Menouar Boulif:
Evaluating Autonomous-Energy-Harvesting Device Lifetime for the Internet of Medical Things with a Petri Net Formulation Considering Battery SoH. IDDM 2022: 56-68 - 2020
- [c2]Nourredine Oukas
A Colored Petri Net to Model Message Differences in Energy Harvesting WSNs. CSA 2020: 143-152 - [i3]Menouar Boulif
Towards a Better Modelling of the Cell Formation Problem: An Overview of Decisions and a Critical analysis of Constraints and Objectives. CoRR abs/2007.11566 (2020)
2010 – 2019
- 2019
- [j4]Ali Chaouche, Menouar Boulif
Solving the unsupervised graph partitioning problem with genetic algorithms: Classical and new encoding representations. Comput. Ind. Eng. 137 (2019) - [i2]Menouar Boulif
Heterogeneous Parallel Genetic Algorithm Paradigm. CoRR abs/1905.06636 (2019) - 2016
- [i1]Menouar Boulif
A new cut-based genetic algorithm for graph partitioning applied to cell formation. CoRR abs/1612.05536 (2016) - 2015
- [j3]Menouar Boulif
Multi-objective cell formation with routing flexibility: a graph partitioning approach. Int. J. Comput. Sci. Eng. 11(2): 186-206 (2015)
2000 – 2009
- 2008
- [j2]Menouar Boulif
A new fuzzy genetic algorithm for the dynamic bi-objective cell formation problem considering passive and active strategies. Int. J. Approx. Reason. 47(2): 141-165 (2008) - 2007
- [c1]Menouar Boulif
A fuzzy genetic algorithm for the dynamic cell formation problem. GECCO 2007: 1502 - 2006
- [j1]Menouar Boulif
A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem. Comput. Oper. Res. 33: 2219-2245 (2006)
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-05 20:24 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: