default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVidushi Vashishth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Zhiyu Lin, Upol Ehsan, Rohan Agarwal, Samihan Dani, Vidushi Vashishth, Mark O. Riedl:
Beyond Following: Mixing Active Initiative into Computational Creativity. CoRR abs/2409.16291 (2024)- 2023
- [c4]Zhiyu Lin, Upol Ehsan, Rohan Agarwal, Samihan Dani, Vidushi Vashishth, Mark O. Riedl:
Beyond Prompts: Exploring the Design Space of Mixed-Initiative Co-Creativity Systems. ICCC 2023: 64-73 - [i3]Zhiyu Lin, Upol Ehsan, Rohan Agarwal, Samihan Dani, Vidushi Vashishth, Mark O. Riedl:
Beyond Prompts: Exploring the Design Space of Mixed-Initiative Co-Creativity Systems. CoRR abs/2305.07465 (2023) - [i2]Amey Agrawal
, Sameer Reddy, Satwik Bhattamishra, Venkata Prabhakara Sarath Nookala, Vidushi Vashishth, Kexin Rong, Alexey Tumanov:
DynaQuant: Compressing Deep Learning Training Checkpoints via Dynamic Quantization. CoRR abs/2306.11800 (2023) - 2021
- [j4]Mehul Sharma, Shrid Pant, Deepak Kumar Sharma, Koyel Datta Gupta, Vidushi Vashishth, Anshuman Chhabra:
Enabling security for the Industrial Internet of Things using deep learning, blockchain, and coalitions. Trans. Emerg. Telecommun. Technol. 32(7) (2021) - 2020
- [j3]Deepak Kumar Sharma, Joel J. P. C. Rodrigues, Vidushi Vashishth, Anirudh Khanna, Anshuman Chhabra:
RLProph: a dynamic programming based reinforcement learning approach for optimal routing in opportunistic IoT networks. Wirel. Networks 26(6): 4319-4338 (2020)
2010 – 2019
- 2019
- [j2]Vidushi Vashishth, Anshuman Chhabra, Deepak Kumar Sharma:
GMMR: A Gaussian mixture model based unsupervised machine learning approach for optimal routing in opportunistic IoT networks. Comput. Commun. 134: 138-148 (2019) - [c3]Vidushi Vashishth, Anshuman Chhabra, Deepak Kumar Sharma:
A Machine Learning Approach Using Classifier Cascades for Optimal Routing in Opportunistic Internet of Things Networks. SECON 2019: 1-9 - 2018
- [j1]Anshuman Chhabra, Vidushi Vashishth, Deepak Kumar Sharma:
A fuzzy logic and game theory based adaptive approach for securing opportunistic networks against black hole attacks. Int. J. Commun. Syst. 31(4) (2018) - [i1]Anshuman Chhabra, Vidushi Vashishth, Anirudh Khanna, Deepak Kumar Sharma, Jyotsna Singh:
An Energy Efficient Routing Protocol for Wireless Internet-of-Things Sensor Networks. CoRR abs/1808.01039 (2018) - 2017
- [c2]Anshuman Chhabra, Vidushi Vashishth, Deepak Kumar Sharma:
SEIR: A Stackelberg game based approach for energy-aware and incentivized routing in selfish Opportunistic Networks. CISS 2017: 1-6 - [c1]Anshuman Chhabra, Vidushi Vashishth, Deepak Kumar Sharma:
A game theory based secure model against Black hole attacks in Opportunistic Networks. CISS 2017: 1-6
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-22 20:13 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:
