default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDalila Boughaci
- > Home > Persons > Dalila Boughaci
Publications
- 2022
[j32]Mourad Lassouaoui
, Dalila Boughaci, Belaid Benhamou:
A synergy Thompson sampling hyper-heuristic for the feature selection problem. Comput. Intell. 38(3): 1083-1105 (2022)- [j31]Larbi Benmezal, Belaid Benhamou, Dalila Boughaci:
Evolutionary Iterated Local Search meta-heuristic for the antenna positioning problem in cellular networks. Comput. Intell. 38(3): 1183-1214 (2022) - 2019
- [j26]Mourad Lassouaoui, Dalila Boughaci, Belaid Benhamou:
A multilevel synergy Thompson sampling hyper-heuristic for solving Max-SAT. Intell. Decis. Technol. 13(2): 193-210 (2019) - [j25]Yasmine Lahsinat, Dalila Boughaci, Belaid Benhamou:
Three Local Search Meta-Heuristics for the Minimum Interference Frequency Assignment Problem (MI-FAP) in Cellular Networks. Int. J. Appl. Metaheuristic Comput. 10(3): 134-150 (2019) - 2018
- [j18]Yasmine Lahsinat, Dalila Boughaci, Belaid Benhamou:
Breakout variable neighbourhood search for the minimum interference frequency assignment problem. J. Syst. Inf. Technol. 20(4): 468-488 (2018) - 2017
- [j13]Mourad Lassouaoui, Dalila Boughaci, Belaid Benhamou:
A multilevel hyper-heuristic for solving Max-SAT. Int. J. Metaheuristics 6(3): 133-159 (2017) - [c26]Yasmine Lahsinat, Dalila Boughaci, Belaid Benhamou:
Harmony Search Based Algorithms for the Minimum Interference Frequency Assignment Problem. ICHSA 2017: 179-189 - [c24]Larbi Benmezal, Belaid Benhamou, Dalila Boughaci:
Some Neighbourhood Approaches for the Antenna Positioning Problem. ICTAI 2017: 1001-1007 - 2010
- [j4]Dalila Boughaci, Belaid Benhamou, Habiba Drias:
Local Search Methods for the Optimal Winner Determination Problem in Combinatorial Auctions. J. Math. Model. Algorithms 9(2): 165-180 (2010) - 2009
- [j3]Dalila Boughaci, Belaid Benhamou, Habiba Drias:
A memetic algorithm for the optimal winner determination problem. Soft Comput. 13(8-9): 905-917 (2009) - 2008
- [j2]Dalila Boughaci, Belaid Benhamou, Habiba Drias:
Scatter Search and Genetic Algorithms for MAX-SAT Problems. J. Math. Model. Algorithms 7(2): 101-124 (2008) - [c10]Dalila Boughaci, Belaid Benhamou, Habiba Drias:
Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions. CP 2008: 593-597 - 2007
- [c8]Dalila Boughaci, Belaid Benhamou, Habiba Drias:
IGA: an Improved Genetic Algorithm for MAX-SAT Problems. IICAI 2007: 132-150 - 2006
- [c7]Dalila Boughaci, Habiba Drias, Ahmed Bendib, Youcef Bouznit, Belaid Benhamou:
Distributed Intrusion Detection Framework based on Autonomous and Mobile Agents. DepCoS-RELCOMEX 2006: 248-255 - [c6]Dalila Boughaci, Habiba Drias, Brahim Oubeka, Abdelkader Aissioui, Belaid Benhamou:
A Distributed Firewall using Autonomous Agents. DepCoS-RELCOMEX 2006: 256-263
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-04-24 23:00 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:
