default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEsmaeil Atashpaz-Gargari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j6]Esmaeil Atashpaz-Gargari, Marcelo da Silva Reis, Ulisses M. Braga-Neto, Junior Barrera
, Edward R. Dougherty:
A fast Branch-and-Bound algorithm for U-curve feature selection. Pattern Recognit. 73: 172-188 (2018)- 2014
- [j5]Esmaeil Atashpaz-Gargari, Ulisses M. Braga-Neto, Edward R. Dougherty:
Modeling and systematic analysis of biomarker validation using selected reaction monitoring. EURASIP J. Bioinform. Syst. Biol. 2014: 17 (2014) - 2013
- [j4]Esmaeil Atashpaz-Gargari, Chao Sima, Ulisses M. Braga-Neto, Edward R. Dougherty:
Relationship between the accuracy of classifier error estimation and complexity of decision boundary. Pattern Recognit. 46(5): 1315-1322 (2013) - [c8]Esmaeil Atashpaz-Gargari, Ulisses M. Braga-Neto, Edward R. Dougherty:
Improved branch-and-bound algorithm for U-curve optimization. GENSiPS 2013: 100-101 - 2012
- [c7]Esmaeil Atashpaz-Gargari, Mohammad Shahrokh Esfahani, Richard Metz, Charles D. Johnson:
OBGene: Optimal barcode generator for NGS experiments. GENSiPS 2012: 90-94 - 2011
- [c6]Esmaeil Atashpaz-Gargari, Ulisses M. Braga-Neto, Edward R. Dougherty:
Multiple reaction monitoring: Modeling and systematic analysis. GENSiPS 2011: 105-107 - [c5]Esmaeil Atashpaz-Gargari, Chao Sima, Ulisses M. Braga-Neto, Edward R. Dougherty:
Relationship between the accuracy of classifier error estimation and distribution complexity. GENSiPS 2011: 147-149 - 2010
- [j3]Salman Nazari Shirkouhi, H. Eivazy, Reza Ghodsi, Kamran Rezaie, Esmaeil Atashpaz-Gargari:
Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm. Expert Syst. Appl. 37(12): 7615-7626 (2010)
2000 – 2009
- 2009
- [j2]Arash Khabbazi, Esmaeil Atashpaz-Gargari, Caro Lucas:
Imperialist competitive algorithm for minimum bit error rate beamforming. Int. J. Bio Inspired Comput. 1(1/2): 125-133 (2009) - 2008
- [j1]Esmaeil Atashpaz-Gargari, Farzad Hashemzadeh, Ramin Rajabioun, Caro Lucas:
Colonial competitive algorithm: A novel approach for PID controller design in MIMO distillation column process. Int. J. Intell. Comput. Cybern. 1(3): 337-355 (2008) - [c4]Esmaeil Atashpaz-Gargari, Farzad Hashemzadeh, Caro Lucas:
Designing MIMO PIID controller using colonial competitive algorithm: Applied to distillation column process. IEEE Congress on Evolutionary Computation 2008: 1929-1934 - [c3]Esmaeil Atashpaz-Gargari, Babak Nadjar Araabi, Caro Lucas:
Optimal fuzzy passing strategy for robot soccer players. FUZZ-IEEE 2008: 1576-1581 - [c2]Ramin Rajabioun, Esmaeil Atashpaz-Gargari, Caro Lucas:
Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement. ICCSA (2) 2008: 680-695 - 2007
- [c1]Esmaeil Atashpaz-Gargari, Caro Lucas:
Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition. IEEE Congress on Evolutionary Computation 2007: 4661-4667
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-05-08 21:41 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:
