default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElham Ahmadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Elham Ahmadi, Seyed Meysam Mousavi, Samira Khojasteh Eghbali
:
A multi-objective model for selecting response strategies of primary and secondary project risks under interval-valued fuzzy uncertainty. Appl. Soft Comput. 160: 111679 (2024)- [i3]Alireza Olama, Andreas Lundell, Jan Kronqvist, Elham Ahmadi, Eduardo Camponogara:
A GPU-Accelerated Bi-linear ADMM Algorithm for Distributed Sparse Machine Learning. CoRR abs/2405.16267 (2024) - 2022
- [j3]Elham Ahmadi, Jafar Zarei, Roozbeh Razavi-Far:
Robust ℓ₁-Controller Design for Discrete-Time Positive T-S Fuzzy Systems Using Dual Approach. IEEE Trans. Syst. Man Cybern. Syst. 52(2): 706-715 (2022) - 2021
- [c9]Elham Ahmadi, Hendro Wicaksono, Omid Fatahi Valilai:
Extending the Last Mile Delivery Routing Problem for Enhancing Sustainability by Drones Using a Sentiment Analysis Approach. IEEM 2021: 207-212 - 2020
- [j2]Elham Ahmadi, Jafar Zarei, Roozbeh Razavi-Far, Mehrdad Saif:
A dual approach for positive T-S fuzzy controller design and its application to cancer treatment under immunotherapy and chemotherapy. Biomed. Signal Process. Control. 58: 101822 (2020)
2010 – 2019
- 2019
- [i2]Elham Ahmadi, Jafar Zarei, Roozbeh Razavi-Far, Mehrdad Saif:
A Dual Approach for Positive T-S Fuzzy Controller Design and Its Application to Cancer Treatment Under Immunotherapy and Chemotherapy. CoRR abs/1912.06777 (2019) - [i1]Elham Ahmadi, Jafar Zarei:
Stability and Stabilization Analysis of Interval Positive Takagi-Sugeno Fuzzy Systems by using Convex Optimization. CoRR abs/1912.06778 (2019) - 2018
- [j1]Elham Ahmadi, Milad Jasemi, Leslie Monplaisir, Mohammad Amin Nabavi, Armin Mahmoodi, Pegah Amini Jam:
New efficient hybrid candlestick technical analysis model for stock market timing on the basis of the Support Vector Machine and Heuristic Algorithms of Imperialist Competition and Genetic. Expert Syst. Appl. 94: 21-31 (2018) - [c8]Elham Ahmadi, Mario A. Nascimento:
Optimal Meeting Points for Public Transit Users. MDM 2018: 15-23 - 2017
- [c7]Elham Ahmadi, Camila F. Costa, Mario A. Nascimento:
Best-Compromise In-Route Nearest Neighbor Queries. SIGSPATIAL/GIS 2017: 41:1-41:10 - [c6]Elham Ahmadi, Mario A. Nascimento:
IBS: An Efficient Stateful Algorithm for Optimal Sequenced Group Trip Planning Queries. MDM 2017: 212-221 - 2016
- [c5]Elham Ahmadi, Mario A. Nascimento:
k-Optimal meeting points based on preferred paths. SIGSPATIAL/GIS 2016: 47:1-47:4 - [c4]Elham Ahmadi, Mario A. Nascimento:
K-Closest Pairs Queries in Road Networks. MDM 2016: 232-241 - 2015
- [c3]Elham Ahmadi, Mario A. Nascimento:
A Mixed Breadth-Depth First Search Strategy for Sequenced Group Trip Planning Queries. MDM (1) 2015: 24-33
2000 – 2009
- 2009
- [c2]Elham Bahman Teymouri, Elham Ahmadi:
The Rational Approach in Contemporary Planning in Iran: (1940 to present) The inner city of Tehran. IKE 2009: 540-546 - 2008
- [c1]Elham Ahmadi:
Knowledge Management in a Sustainable Tourism Planning. IKE 2008: 441-444
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-10-07 22:10 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:
