91 programming-"https:"-"FEMTO-ST"-"UCL"-"https:"-"https:"-"https:"-"https:"-"NOVA.id" positions in Sweden
Sort by
Refine Your Search
-
Listed
-
Category
-
Program
-
Employer
-
Field
-
applicable to thin-film type equations is welcomed. The position enables short research visits within the international network program Instability phenomena in asymptotic models in fluid dynamics
-
Experience with experimental work in cancer Strong communication and collaboration skills Merits: Experience with primary tumor cells Experience with programming in R Eligibility Students with basic
-
. Project description: DDLS Fellows Program Data-driven life science (DDLS) uses data, computational methods and artificial intelligence to study biological systems and processes at all levels, from molecular
-
development. Work responsibilities The candidate will lead a multidisciplinary research program investigating the genotoxic and epigenetic effects of NPs. Responsibilities include developing mutagenesis assays
-
Transformation and as a Transformative Power (ProTest), funded by Horizon Europe – the European Union’s key funding programme for research and innovation. The project aims to analyse the context, current state
-
of data-driven life science and includes access to a formidable package of resources. Project description: DDLS Fellows Program Data-driven life science (DDLS) uses data, computational methods and
-
scientific and pedagogical excellence, along with strong potential to establish an independent, high-impact research program aligned with the focus areas of Molecular Biology and the MIMS organization
-
proficient in the project related areas, and in particular regarding: Machine Learning, Numerical Methods, Probability Theory, and Bayesian Methods and MCMC Algorithms. Proficient programming skills is a
-
examination and expected examination date). • Research plan (max. 2500 words including references) describing the research you plan to conduct within the scope of the position • Contact details for 2 references
-
satisfiability (SAT) solving, Gröbner basis computations, integer linear programming, and constraint programming. This leads to classical questions in computational complexity theory—though often with new