default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKhulood AlYahya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[p1]Khulood AlYahya, Kevin A. J. Doherty, Ozgur E. Akman, Jonathan E. Fieldsend:
Reduced Models of Gene Regulatory Networks: Visualising Multi-modal Landscapes. Metaheuristics for Finding Multiple Solutions 2021: 229-258
2010 – 2019
- 2019
- [j4]Khulood AlYahya, Jonathan E. Rowe:
Landscape Analysis of a Class of NP-Hard Binary Packing Problems. Evol. Comput. 27(1): 47-73 (2019) - [j3]Dan R. Ghica
, Khulood AlYahya:
Latent semantic analysis of game models using LSTM. J. Log. Algebraic Methods Program. 106: 39-54 (2019) - [c12]Khulood AlYahya, Ozgur E. Akman, Jonathan E. Fieldsend:
Landscape analysis under measurement error. GECCO (Companion) 2019: 1415-1418 - [c11]Jonathan E. Fieldsend, Khulood AlYahya:
Visualising the landscape of multi-objective problems using local optima networks. GECCO (Companion) 2019: 1421-1429 - 2018
- [j2]Hala S. Own, Khulood AlYahya, Waheeda Al-Mayyan, Ajith Abraham:
Rough set-BPSO model for predicting vitamin D deficiency in apparently healthy Kuwaiti women based on hair mineral analysis. Neural Comput. Appl. 29(2): 329-344 (2018) - [c10]Kevin Anthony James Doherty, Khulood AlYahya, Jonathan E. Fieldsend, Ozgur E. Akman:
Voronoi-based archive sampling for robust optimisation. GECCO (Companion) 2018: 249-250 - [c9]Khulood AlYahya, Kevin Anthony James Doherty, Ozgur E. Akman, Jonathan E. Fieldsend:
Robust multi-modal optimisation. GECCO (Companion) 2018: 1783-1790 - 2017
- [b1]Khulood AlYahya:
Fitness landscape analysis of a class of NP-hard problems. University of Birmingham, UK, 2017 - [c8]Khulood AlYahya, Kevin Anthony James Doherty, Jonathan E. Fieldsend, Ozgur E. Akman:
On the exploitation of search history and accumulative sampling in robust optimisation. GECCO (Companion) 2017: 185-186 - [c7]Kevin Anthony James Doherty, Khulood AlYahya, Ozgur E. Akman, Jonathan E. Fieldsend:
Optimisation and landscape analysis of computational biology models: a case study. GECCO (Companion) 2017: 1644-1651 - [c6]Dan R. Ghica, Khulood AlYahya:
On the Learnability of Programming Language Semantics. ICE@DisCoTec 2017: 57-75 - 2016
- [c5]Khulood AlYahya, Jonathan E. Rowe:
Simple Random Sampling Estimation of the Number of Local Optima. PPSN 2016: 932-941 - 2015
- [c4]Khulood AlYahya, Jonathan E. Rowe:
Landscape Properties of the 0-1 Knapsack Problem. GECCO (Companion) 2015: 1343-1344 - 2014
- [j1]John A. Bullinaria, Khulood AlYahya:
Artificial Bee Colony training of neural networks: comparison with back-propagation. Memetic Comput. 6(3): 171-182 (2014) - [c3]Khulood AlYahya, Jonathan E. Rowe:
Phase Transition and Landscape Properties of the Number Partitioning Problem. EvoCOP 2014: 206-217 - [c2]Khulood AlYahya, Jonathan E. Rowe:
Local Optima and Weight Distribution in the Number Partitioning Problem. PPSN 2014: 862-871 - 2013
- [c1]John A. Bullinaria, Khulood AlYahya:
Artificial Bee Colony Training of Neural Networks. NICSO 2013: 191-201
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 05:56 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:
