default search action
Huw Lloyd
Person information
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Tulasi Kavarakuntla, Liangxiu Han, Huw Lloyd, Annabel Latham, Anthony Kleerekoper, Samson B. Akintoye:
A Generic Performance Model for Deep Learning in a Distributed Environment. IEEE Access 12: 8207-8219 (2024) - [c9]Alexander Brooke, Matthew Crossley, Huw Lloyd, Stuart Cunningham:
Assessing Type Agreeability in the Unified Model of Personality and Play Styles. CoG 2024: 1-8 - 2023
- [j5]Samson B. Akintoye, Liangxiu Han, Huw Lloyd, X. Zhang, Darren Dancey, Haoming Chen, Daoqiang Zhang:
Layer-wise partitioning and merging for efficient and scalable deep learning. Future Gener. Comput. Syst. 149: 432-444 (2023) - [c8]Ngozi Nneke, Huw Lloyd, Keeley Crockett:
Quantification of Explainability in Black Box Models using Complexity Measures. IIT 2023: 85-92 - [i3]Tulasi Kavarakuntla, Liangxiu Han, Huw Lloyd, Annabel Latham, Anthony Kleerekoper, Samson B. Akintoye:
A Generic Performance Model for Deep Learning in a Distributed Environment. CoRR abs/2305.11665 (2023) - 2022
- [j4]Joshua Peake, Martyn Amos, Nicholas Costen, Giovanni Luca Masala, Huw Lloyd:
PACO-VMP: Parallel Ant Colony Optimization for Virtual Machine Placement. Future Gener. Comput. Syst. 129: 174-186 (2022) - [j3]Huw Lloyd, Matthew Crossley, Mark C. Sinclair, Martyn Amos:
J-POP: Japanese Puzzles as Optimization Problems. IEEE Trans. Games 14(3): 391-402 (2022) - [i2]Samson B. Akintoye, Liangxiu Han, Huw Lloyd, Xin Zhang, Darren Dancey, Haoming Chen, Daoqiang Zhang:
Layer-Wise Partitioning and Merging for Efficient and Scalable Deep Learning. CoRR abs/2207.11019 (2022) - 2021
- [j2]Sohail Jabbar, Huw Lloyd, Mohammad Hammoudeh, Bamidele Adebisi, Umar Raza:
Blockchain-enabled supply chain: analysis, challenges, and future directions. Multim. Syst. 27(4): 787-806 (2021) - 2020
- [j1]Huw Lloyd, Martyn Amos:
Solving Sudoku With Ant Colony Optimization. IEEE Trans. Games 12(3): 302-311 (2020)
2010 – 2019
- 2019
- [c7]Joshua Peake, Martyn Amos, Paraskevas Yiapanis, Huw Lloyd:
Scaling techniques for parallel ant colony optimization on large problem instances. GECCO 2019: 47-54 - [c6]Martyn Amos, Matthew Crossley, Huw Lloyd:
Solving nurikabe with ant colony optimization. GECCO (Companion) 2019: 129-130 - [c5]Huw Lloyd:
Decentralized Parallel Any Colony Optimization for Distributed Memory Systems. SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI 2019: 1561-1567 - [c4]Huw Lloyd, Mohammad Hammoudeh:
A Distributed Cellular Automaton Algorithm for Barrier Formation in Mobile Sensor Networks. Wireless Days 2019: 1-4 - 2018
- [c3]Joshua Peake, Martyn Amos, Paraskevas Yiapanis, Huw Lloyd:
Vectorized candidate set selection for parallel ant colony optimization. GECCO (Companion) 2018: 1300-1306 - [i1]Huw Lloyd, Martyn Amos:
Solving Sudoku with Ant Colony Optimisation. CoRR abs/1805.03545 (2018) - 2017
- [c2]Huw Lloyd, Martyn Amos:
Analysis of independent roulette selection in parallel ant colony optimization. GECCO 2017: 19-26 - 2016
- [c1]Huw Lloyd, Martyn Amos:
A highly parallelized and vectorized implementation of Max-Min Ant System on Intel® Xeon Phi™. SSCI 2016: 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-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint