default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKyle Erwin
2020 – today
- 2025
[c10]Stephen Carrow, Kyle Erwin, Olga Vilenskaia, Parikshit Ram, Tim Klinger, Naweed Khan, Ndivhuwo Makondo, Alexander G. Gray:
Neural Reasoning Networks: Efficient Interpretable Neural Networks with Automatic Textual Explanations. AAAI 2025: 15669-15677- [i2]Kyle Erwin, Guy Axelrod, Maria Chang, Achille Fokoue, Maxwell Crouse, Soham Dan, Tian Gao, Rosario Uceda-Sosa, Ndivhuwo Makondo, Naweed Khan, Alexander G. Gray:
Few-shot Policy (de)composition in Conversational Question Answering. CoRR abs/2501.11335 (2025) - 2024
- [i1]Stephen Carrow, Kyle Harper Erwin, Olga Vilenskaia, Parikshit Ram, Tim Klinger, Naweed Aghmad Khan, Ndivhuwo Makondo, Alexander Gray:
Neural Reasoning Networks: Efficient Interpretable Neural Networks With Automatic Textual Explanations. CoRR abs/2410.07966 (2024) - 2023
- [j3]Kyle Erwin
, Andries P. Engelbrecht:
Multi-Guide Set-Based Particle Swarm Optimization for Multi-Objective Portfolio Optimization. Algorithms 16(2): 62 (2023) - [j2]Kyle Erwin, Andries P. Engelbrecht:
Feature-Based Complexity Measure for Multinomial Classification Datasets. Entropy 25(7): 1000 (2023) - [j1]Kyle Erwin, Andries P. Engelbrecht:
Meta-heuristics for portfolio optimization. Soft Comput. 27(24): 19045-19073 (2023) - [c9]Shajith Ikbal, Udit Sharma, Hima Karanam, Sumit Neelam, Ronny Luss, Dheeraj Sreedhar, Pavan Kapanipathi, Naweed Khan, Kyle Erwin, Ndivhuwo Makondo, Ibrahim Abdelaziz, Achille Fokoue, Alexander Gray, Maxwell Crouse, Subhajit Chaudhury, Chitra Subramanian:
Self-Supervised Rule Learning to Link Text Segments to Relational Elements of Structured Knowledge. EMNLP (Findings) 2023: 1707-1718 - [c8]Kyle Erwin, Andries P. Engelbrecht:
Meta-heuristics for Portfolio Optimization: Part I - Review of Meta-heuristics. ICSI (2) 2023: 441-452 - [c7]Kyle Erwin, Andries P. Engelbrecht:
Meta-heuristics for Portfolio Optimization: Part II - Empirical Analysis. ICSI (2) 2023: 453-464 - 2022
- [c6]Kyle Erwin, Andries P. Engelbrecht:
Improved Hamming Diversity Measure for Set-Based Optimization Algorithms. ICSI (1) 2022: 39-47 - 2021
- [c5]Kyle Erwin, Andries P. Engelbrecht:
Set-based Particle Swarm Optimization for Portfolio Optimization with Adaptive Coordinate Descent Weight Optimization. SSCI 2021: 1-8 - [c4]Kyle Erwin, Andries P. Engelbrecht:
A Tuning Free Approach to Multi-guide Particle Swarm Optimization. SSCI 2021: 1-8 - 2020
- [c3]Kyle Erwin, Andries P. Engelbrecht:
Set-Based Particle Swarm Optimization for Portfolio Optimization. ANTS Conference 2020: 333-339 - [c2]Kyle Erwin, Andries P. Engelbrecht:
Improved Set-based Particle Swarm optimization for Portfolio optimization. SSCI 2020: 1573-1580
2010 – 2019
- 2019
- [c1]Kyle Erwin, Andries P. Engelbrecht:
Control parameter sensitivity analysis of the multi-guide particle swarm optimization algorithm. GECCO 2019: 22-29
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.
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.
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.
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 2025-04-20 23:52 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:
