Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUmair F. Siddiqi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j14]Umair F. Siddiqi
, Sadiq M. Sait, Khaled Abdul-Aziz Al-Utaibi:
A Machine Learning Method to Synthesize Channel State Information Data in Millimeter Wave Networks. IEEE Access 9: 83441-83452 (2021)- [j13]Omar Maraqa, Umair F. Siddiqi, Saad Al-Ahmadi, Sadiq M. Sait:
On the Achievable Max-Min User Rates in Multi-Carrier Centralized NOMA-VLC Networks. Sensors 21(11): 3705 (2021) - 2020
- [j12]Umair F. Siddiqi, Sadiq M. Sait, Okyay Kaynak:
Genetic Algorithm for the Mutual Information-Based Feature Selection in Univariate Time Series Data. IEEE Access 8: 9597-9609 (2020) - [j11]Umair F. Siddiqi, Sadiq M. Sait, Murat Uysal:
Deep Q-Learning Based Optimization of VLC Systems With Dynamic Time-Division Multiplexing. IEEE Access 8: 120375-120387 (2020) - [j10]Umair F. Siddiqi, Sadiq M. Sait, Murat Uysal:
Deep Reinforcement Based Power Allocation for the Max-Min Optimization in Non-Orthogonal Multiple Access. IEEE Access 8: 211235-211247 (2020) - [j9]Umair F. Siddiqi, Omer Narmanlioglu, Murat Uysal, Sadiq M. Sait:
Joint bit and power loading for adaptive MIMO OFDM VLC systems. Trans. Emerg. Telecommun. Technol. 31(7) (2020) - 2019
- [j8]Umair F. Siddiqi, Sadiq M. Sait, Muhammet Selim Demir, Murat Uysal:
Resource Allocation for Visible Light Communication Systems Using Simulated Annealing Based on a Problem-Specific Neighbor Function. IEEE Access 7: 64077-64091 (2019) - 2018
- [j7]Umair F. Siddiqi, Sadiq M. Sait:
An Optimization Heuristic Based on Non-Dominated Sorting and Tabu Search for the Fixed Spectrum Frequency Assignment Problem. IEEE Access 6: 72635-72648 (2018) - 2017
- [j6]Umair F. Siddiqi, Sadiq M. Sait:
A Game Theory Based Post-Processing Method to Enhance VLSI Global Routers. IEEE Access 5: 1328-1339 (2017) - [j5]Umair F. Siddiqi, Sadiq M. Sait:
A New Heuristic for the Data Clustering Problem. IEEE Access 5: 6801-6812 (2017) - 2016
- [j4]Sadiq M. Sait, Umair F. Siddiqi:
A stochastic evolution algorithm based 2D VLSI global router. Integr. 53: 115-125 (2016) - 2015
- [j3]Umair F. Siddiqi, Sadiq M. Sait, Yoichi Shiraishi:
A Game Theory-Based Heuristic for the Two-Dimensional VLSI Global Routing Problem. J. Circuits Syst. Comput. 24(6): 1550082:1-1550082:19 (2015) - 2014
- [j2]Umair F. Siddiqi, Yoichi Shiraishi, Mona Abo El Dahb, Sadiq M. Sait:
A memory efficient stochastic evolution based algorithm for the multi-objective shortest path problem. Appl. Soft Comput. 14: 653-662 (2014) - 2012
- [j1]Umair Farooq Siddiqi, Yoichi Shiraishi, Sadiq M. Sait:
Multi-objective optimal path selection in electric vehicles. Artif. Life Robotics 17(1): 113-122 (2012)
Conference and Workshop Papers
- 2023
- [c11]Umair F. Siddiqi, Sadiq M. Sait:
Obstacle Avoidance Rectilinear Steiner Minimal Tree Length Estimation Using Deep Learning. ISCIT 2023: 1-6 - [c10]Umair F. Siddiqi, Sadiq M. Sait:
On improving the critical path delay of PathFinder at smaller channel widths. ISCIT 2023: 127-132 - [c9]Umair F. Siddiqi, Gary William Grewal, Shawki Areibi:
A Deterministic Parallel Routing Approach for Accelerating Pathfinder-based Algorithms. VLSI-SoC 2023: 1-6 - 2022
- [c8]Umair F. Siddiqi, Timothy Martin, Sam Van Den Eijnden, Ahmed Shamli, Gary Gréwal, Sadiq M. Sait, Shawki Areibi:
Faster FPGA Routing by Forecasting and Pre-Loading Congestion Information. MLCAD 2022: 15-20 - 2012
- [c7]Umair F. Siddiqi, Yoichi Shiraishi, Mona Abo El Dahb, Sadiq M. Sait:
Finding Multi-Objective Shortest Paths Using Memory-Efficient Stochastic Evolution Based Algorithm. ICNC 2012: 182-187 - 2011
- [c6]Umair F. Siddiqi, Yoichi Shiraishi, Mona Abo El Dahb, Sadiq M. Sait:
Simulated Evolution (SimE) Based Embedded System Synthesis Algorithm for Electric Circuit Units (ECUs). ICANNGA (1) 2011: 400-409 - [c5]Umair Farooq Siddiqi, Yoichi Shiraishi, Sadiq M. Sait:
Multi-constrained route optimization for Electric Vehicles (EVs) using Particle Swarm Optimization (PSO). ISDA 2011: 391-396 - [c4]Umair F. Siddiqi, Yoichi Shiraishi, Sadiq M. Sait:
Multi constrained Route Optimization for Electric Vehicles using SimE. SoCPaR 2011: 376-383 - 2009
- [c3]Mayez A. Al-Mouhamed, Umair F. Siddiqi:
Performance evaluation of auctions WLAN for RoboCup multi-robot cooperation. AICCSA 2009: 610-615 - 2008
- [c2]Umair F. Siddiqi, Sadiq M. Sait:
Algorithm for parallel inverse halftoning using partitioning of Look-Up Table (LUT). ISCAS 2008: 3554-3557 - 2005
- [c1]Umair F. Siddiqi, Sadiq M. Sait, Aamir A. Farooqui:
Parallel algorithm for hardware implementation of inverse halftoning. ISCAS (3) 2005: 2377-2380
Informal and Other Publications
- 2021
- [i1]Omar Maraqa, Umair F. Siddiqi, Saad Al-Ahmadi, Sadiq M. Sait:
On the Achievable Max-Min User Rates in Multi-Carrier Centralized NOMA-VLC Networks. CoRR abs/2105.12821 (2021)
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:21 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:
