Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTapan Shah 0001
Person information
- affiliation: Tata Institute of Technology, School of Technology and Computer Science, Mumbai, India
Other persons with the same name
- Tapan Shah 0002 — Indian Institute of Technology Kharagpur, Department of Electronics and Electrical Communication Engineering, India
- Tapan Shah 0003 — Corporate R&D Raychem RPG Pvt Ltd, Vadodara, India
- Tapan Shah 0004 — GE Global Research, San Ramon, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j2]Yingqian Zhang
, Laurens Bliek, Paulo da Costa, Reza Refaei Afshar, Robbert Reijnen, Tom Catshoek, Daniël Vos, Sicco Verwer, Fynn Schmitt-Ulms, André Hottung, Tapan Shah, Meinolf Sellmann, Kevin Tierney, Carl Perreault-Lafleur, Caroline Leboeuf, Federico Bobbio, Justine Pepin, Warley Almeida Silva, Ricardo Gama, Hugo L. Fernandes, Martin Zaefferer, Manuel López-Ibáñez, Ekhine Irurozki:
The first AI4TSP competition: Learning to solve stochastic routing problems. Artif. Intell. 319: 103918 (2023)- 2022
- [c3]Meinolf Sellmann, Tapan Shah:
Cost-sensitive Hierarchical Clustering for Dynamic Classifier Selection. ICMLA 2022: 782-787 - [i5]Laurens Bliek, Paulo da Costa, Reza Refaei Afshar, Yingqian Zhang, Tom Catshoek, Daniël Vos, Sicco Verwer, Fynn Schmitt-Ulms, André Hottung, Tapan Shah, Meinolf Sellmann, Kevin Tierney, Carl Perreault-Lafleur, Caroline Leboeuf, Federico Bobbio, Justine Pepin, Warley Almeida Silva, Ricardo Gama, Hugo L. Fernandes, Martin Zaefferer, Manuel López-Ibáñez, Ekhine Irurozki:
The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems. CoRR abs/2201.10453 (2022) - 2021
- [c2]Carlos Ansótegui, Meinolf Sellmann, Tapan Shah, Kevin Tierney:
Learning to Optimize Black-Box Functions with Extreme Limits on the Number of Function Evaluations. LION 2021: 7-24 - [i4]Carlos Ansótegui, Meinolf Sellmann, Tapan Shah, Kevin Tierney:
Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluations. CoRR abs/2103.10321 (2021) - 2020
- [i3]Meinolf Sellmann, Tapan Shah:
Cost-sensitive Hierarchical Clustering for Dynamic Classifier Selection. CoRR abs/2012.09608 (2020)
2010 – 2019
- 2013
- [j1]Tapan Shah, Onkar Dabeer:
Optimal Subcarrier Power Allocation for OFDM with Low Precision ADC at Receiver. IEEE Trans. Commun. 61(11): 4591-4601 (2013) - [i2]Tapan Shah, Onkar Dabeer:
Transmit Beamforming for MIMO Communication Systems with Low Precision ADC at the Receiver. CoRR abs/1310.1571 (2013) - 2012
- [c1]Tapan Shah, Onkar Dabeer:
Subcarrier Power Allocation in OFDM with Low Precision ADC at Receiver. VTC Fall 2012: 1-5 - 2010
- [i1]Naqueeb Warsi, Rahul Vaze, Tapan Shah:
Communicating Under Channel Uncertainty. CoRR abs/1010.1605 (2010)
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-04-25 02:16 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:
