default search action
Farah Aït-Salaht
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c15]Farah Aït-Salaht, Maher Rebai, Nora Izri:
Optimizing Service Replication and Placement for IoT Applications in Fog Computing Systems. Euro-Par (1) 2024: 283-297 - 2021
- [j2]Farah Aït-Salaht, Frédéric Desprez, Adrien Lebre:
An Overview of Service Placement Problem in Fog and Edge Computing. ACM Comput. Surv. 53(3): 65:1-65:35 (2021)
2010 – 2019
- 2019
- [c14]Farah Aït-Salaht, Frédéric Desprez, Adrien Lebre, Charles Prud'homme, Mohamed Abderrahim:
Service Placement in Fog Computing Using Constraint Programming. SCC 2019: 19-27 - 2017
- [c13]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Stochastic Bounds for Switched Bernoulli Batch Arrivals Observed Through Measurements. ASMTA 2017: 1-15 - [c12]Mohamed Mehdi Kandi, Farah Aït-Salaht, Hind Castel-Taleb, Emmanuel Hyon:
Analysis of Performance and Energy Consumption in the Cloud. EPEW 2017: 199-213 - 2016
- [j1]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Performance Analysis of a Queue by Combining Stochastic Bounds, Real Traffic Traces and Histograms. Comput. J. 59(12): 1817-1830 (2016) - [c11]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Stochastic Bounds and Histograms for Active Queues Management and Networks Analysis. ASMTA 2016: 1-16 - [c10]Farah Aït-Salaht, Hind Castel-Taleb:
Bounding Aggregations on Phase-Type Arrivals for Performance Analysis of Clouds. MASCOTS 2016: 319-324 - 2015
- [c9]Farah Aït-Salaht, Hind Castel-Taleb:
Stochastic Bounding Models for Performance Analysis of Clouds. CIT/IUCC/DASC/PICom 2015: 603-610 - [c8]Farah Aït-Salaht, Hind Castel:
Bounding aggregations on bulk arrivals for performance analysis of clouds. AICCSA 2015: 1-8 - [c7]Farah Aït-Salaht, Hind Castel-Taleb:
The threshold based queueing system with hysteresis for performance analysis of clouds. CITS 2015: 1-5 - [c6]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Thierry Mautor, Nihal Pekergin:
Smoothing the Input Process in a Batch Queue. ISCIS 2015: 223-232 - 2013
- [c5]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Stochastic Bounds and Histograms for Network Performance Analysis. EPEW 2013: 13-27 - [c4]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
A Bounding Histogram Approach for Network Performance Analysis. HPCC/EUC 2013: 458-465 - [c3]Farah Aït-Salaht, Jean-Michel Fourneau, Nihal Pekergin:
Computing Bounds of the MTTF for a Set of Markov Chains. ISCIS 2013: 67-76 - 2012
- [c2]Farah Aït-Salaht, Jean-Michel Fourneau, Nihal Pekergin:
Computing Entry-Wise Bounds of the Steady-State Distribution of a Set of Markov Chains. ISCIS 2012: 115-122 - [c1]Farah Aït-Salaht, Johanne Cohen, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Accuracy vs. complexity: The stochastic bound approach. WODES 2012: 343-348
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-09-09 01:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint