default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMujahid N. Syed
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Mujahid N. Syed
:
Feature selection in machine learning via variable neighborhood search. Optim. Lett. 17(9): 2321-2345 (2023)- [c5]Hossein Moosaei, Saeed Ketabchi, Mujahid N. Syed, Fatemeh Bazikar:
Augmented Lagrangian Method for Linear Programming Using Smooth Approximation. DIS 2023: 186-193 - [c4]Mujahid N. Syed:
Optimizing Classroom Assignments to Reduce Non-essential Interactions Among University-Level Students During Pandemics. DIS 2023: 232-241 - [c3]Alhassan M. Aldabbagh, Mujahid N. Syed:
Metaheuristic Approach to Artificial Neural Network Optimization. SNAMS 2023: 1-8 - 2022
- [j11]Mujahid N. Syed:
Neighborhood density information in clustering. Ann. Math. Artif. Intell. 90(7-9): 855-872 (2022) - [j10]Mujahid N. Syed, Uthman Baroudi:
Tactile Routing for Location Privacy Preservation in Wireless Sensor Networks: A Game Theoretic Approach. Sensors 22(19): 7334 (2022) - 2021
- [j9]Mujahid N. Syed, Md. Rafiul Hassan, Irfan Ahmad, Mohammad Mehedi Hassan, Victor Hugo C. de Albuquerque:
A Novel Linear Classifier for Class Imbalance Data Arising in Failure-Prone Air Pressure Systems. IEEE Access 9: 4211-4222 (2021) - 2020
- [j8]Haseeb Tahir, Mujahid N. Syed, Uthman Baroudi:
Heuristic Approach for Real-Time Multi-Agent Trajectory Planning Under Uncertainty. IEEE Access 8: 3812-3826 (2020) - [c2]Mujahid N. Syed:
Least Correntropic Loss Regression. LION 2020: 402-413
2010 – 2019
- 2018
- [j7]Mujahid N. Syed:
Big Data Blind Separation. Entropy 20(3): 150 (2018) - 2017
- [j6]Mohammad A. M. Abdel-Aal, Mujahid N. Syed, Shokri Z. Selim:
Multi-product selective newsvendor problem with service level constraints and market selection flexibility. Int. J. Prod. Res. 55(1): 96-117 (2017) - 2014
- [j5]Mujahid N. Syed, Pando G. Georgiev, Panos M. Pardalos:
A hierarchical approach for sparse source Blind Signal Separation problem. Comput. Oper. Res. 41: 386-398 (2014) - [j4]Mujahid N. Syed, Panos M. Pardalos, José C. Príncipe:
On the optimization properties of the correntropic loss function in data analysis. Optim. Lett. 8(3): 823-839 (2014) - 2013
- [j3]El-Sayed M. El-Alfy, Mujahid N. Syed, Shokri Z. Selim:
A Pareto-based hybrid multiobjective evolutionary approach for constrained multipath traffic engineering optimization in MPLS/GMPLS networks. J. Netw. Comput. Appl. 36(4): 1196-1207 (2013) - [j2]Mujahid N. Syed, Panos M. Pardalos, José C. Príncipe:
Invexity of the Minimum Error Entropy Criterion. IEEE Signal Process. Lett. 20(12): 1159-1162 (2013) - 2011
- [j1]Mujahid N. Syed, Ilias S. Kotsireas, Panos M. Pardalos:
D-Optimal Designs: A Mathematical Programming Approach Using Cyclotomic Cosets. Informatica 22(4): 577-587 (2011)
2000 – 2009
- 2007
- [c1]El-Sayed M. El-Alfy, Shokri Z. Selim, Mujahid N. Syed:
Solving the minimum-cost constrained multipath routing with load balancing in MPLS networks using an evolutionary method. IEEE Congress on Evolutionary Computation 2007: 4433-4438
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-02 21:49 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:
