Sort by
Refine Your Search
-
Listed
-
Employer
- ;
- Cranfield University
- University of Nottingham
- ; Swansea University
- University of Manchester
- ; University of Birmingham
- ; The University of Manchester
- ; University of Nottingham
- ; Loughborough University
- ; University of Exeter
- ; Newcastle University
- ; University of Leeds
- ; The University of Edinburgh
- ; Cranfield University
- ; University of Reading
- ; University of Surrey
- ; University of Warwick
- ; City St George’s, University of London
- ; University of Sheffield
- ; University of Southampton
- ; University of Bristol
- ; University of Sussex
- UNIVERSITY OF VIENNA
- ; Edge Hill University
- ; University of Bradford
- ; University of Strathclyde
- Harper Adams University
- University of Cambridge
- University of Sheffield
- University of Warwick
- ; EPSRC Centre for Doctoral Training in Green Industrial Futures
- ; Lancaster University
- ; University of Cambridge
- ; University of Greenwich
- ; University of Hertfordshire
- ; University of Oxford
- ; University of Plymouth
- Abertay University
- ; Aston University
- ; Bangor University
- ; Brunel University London
- ; Coventry University Group
- ; Durham University
- ; Imperial College London
- ; King's College London
- ; London South Bank University
- ; Manchester Metropolitan University
- ; Queen's University Belfast
- ; Royal Northern College of Music
- ; St George's, University of London
- ; The Open University
- ; UCL
- ; UWE, Bristol
- ; University of Essex
- ; University of Hull
- ; University of Kent
- ; University of Portsmouth
- ; University of Stirling
- ; University of York
- University of East London
- University of Liverpool
- University of Newcastle
- 52 more »
- « less
-
Field
-
Approximation. Parameterized Complexity is a vastly growing area within theoretical computer science that allows for the development of exact and approximation algorithms for computationally hard problems by
-
integrates machine learning and statistics to improve the efficiency and scalability of statistical algorithms. The project will develop innovative techniques to accelerate computational methods in uncertainty
-
Kyropoulou and will work in areas related to (Theoretical) Computer Science, Algorithmic Game Theory, and/or Fair Division with potential applications in Blockchain in the context of the EPSRC funded research
-
variants of importance sampling. We will connect these methods to modern formulations of Monte Carlo algorithms to improve their accuracy, scalability, and overall computational cost. The methodology so
-
the ranking. However, STV method becomes considerably more complex with encrypted ballots. Our goal is to develop an algorithm/protocol to count encrypted ballot using the STV method. Our first point of
-
The School of Computing at the University of Kent and Huawei invite applications for 2 fully-funded 3.5-year PhD scholarships for Home and Overseas students. You can apply for a PhD on the topic
-
leverage low-precision accelerators for scientific computing by using a number of tricks, known as "mixed-precision" algorithms. Developing such algorithms is far from trivial. We can look at computational
-
formulation, which displays striking similarities to that used by the Computational Fluid Dynamics (CFD) community, has inspired the investigators to adopt conventional CFD algorithms in the novel context
-
The primary objective of this project is to establish the evidence base on professional cycling road ‘racing’ trends and the critical tactical moments that determine how races are won. This evidence will inform future race strategy and live race tactics. Multiple factors influence the strategy...
-
This PhD project aims to advance Safe and Sustainable by Design (SSbD) pharmaceutical manufacturing by integrating cutting-edge methodologies, including computer-assisted retrosynthesis, end-to-end