52 computional-geometry-algorithm positions at Chalmers University of Technology in Sweden
Sort by
Refine Your Search
-
Are you interested in crossing borders between geometry, numerics, and physics?The position at hand challenges you to work both as a mathematician and a physicist in the area of plasma physics and
-
is essential for a sustainable society. In this project, you will develop and apply advanced computational techniques to explore nano-catalysts for hydrogen carrier synthesis. Our vision is to
-
Recognised Researcher (R2) Country Sweden Application Deadline 29 Sep 2025 - 22:00 (UTC) Type of Contract Temporary Job Status Full-time Is the job funded through the EU Research Framework Programme? Not
-
methods for creating innovative heat-exchanger geometries with high efficiency and sustainability in mind. You will use open-source machine learning software provided by Meta AI and OpenAI, deployed
-
operation Quantum algorithm implementation and benchmarking About you You have a relevant Masters deegree corresponding to at least 240 higher education credits (Physics, Nanotechnology, Engineering, Computer
-
We invite applications for several postdoctoral research positions in experimental quantum computing with superconducting circuits. You will work in the stimulating research environment
-
2025 - 12:00 (UTC) Type of Contract Temporary Job Status Full-time Is the job funded through the EU Research Framework Programme? Not funded by a EU programme Is the Job related to staff position within
-
, Reinforcement Learning, Parallel Computing Practical experience with legged robots such as quadrupeds or humanoid robots Motion planning and control algorithms for robot locomotion Experience with libraries
-
the application of machine learning to optics, touching upon aspects of computational electromagnetism and inverse design. Information about the project and division Structured optical materials, such as
-
actions to evaluate, balancing safety and computational effort. You will compare deep learning–based methods and probabilistic machine learning approaches, and explore extensions to active reachability