Sort by
Refine Your Search
-
Employer
- Cranfield University
- ;
- ; The University of Manchester
- ; Newcastle University
- ; Swansea University
- ; University of Cambridge
- ; University of Leeds
- University of Cambridge
- University of Nottingham
- ; Aston University
- ; Brunel University London
- ; University of Birmingham
- ; University of Bristol
- ; University of East Anglia
- ; University of Exeter
- ; University of Oxford
- ; University of Sheffield
- ; University of Southampton
- ; University of Surrey
- ; University of Warwick
- Harper Adams University
- 11 more »
- « less
-
Field
-
address: Dr Fahad Panolan: f.panolan@leeds.ac.uk Project summary The Algorithms group at the University of Leeds (UK) is offering a fully funded 3.5-year PhD studentship on Parameterized Complexity and
-
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
-
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
-
objects, by embedding them into a 2 or 3-dimensional space through a representation learning algorithm, has been widely used for data exploratory analysis. It is particularly popular in areas such as
-
needs. By bridging human-centric innovation, generative algorithms, and sustainability metrics, this project seeks to redefine how novel products and systems are conceived, developed, and evaluated. You
-
harness advanced techniques such as machine learning, optimization algorithms, and sensitivity analysis to automate and enhance the mode selection process. The result will be a scalable methodology that
-
) uses principles from systems neuroscience to develop reliable, low-power spiking neural networks and learning algorithms for implementation in a new generation of neuromorphic hardware. Both projects
-
will develop autonomous on-board guidance algorithms for space missions using open-source numerical solvers for convex optimisation developed at the University of Oxford. The focus will be on designing
-
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
-
et al (2015). A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem. European Journal of Operational Research.