Sort by
Refine Your Search
-
Listed
-
Employer
- Chalmers University of Technology
- KTH Royal Institute of Technology
- Sveriges lantbruksuniversitet
- Linköping University
- Luleå University of Technology
- Nature Careers
- University of Lund
- Blekinge Institute of Technology
- Linnaeus University
- Lund university
- Lunds universitet
- Umeå University
- University of Gothenburg
- 3 more »
- « less
-
Field
-
/InstituteUniversity of GothenburgCountrySwedenCityGöteborgPostal Code40530StreetBox 711 Contact City Göteborg Street Box 711 Postal Code 40530 STATUS: EXPIRED X (formerly Twitter) Facebook LinkedIn Whatsapp More share
-
control, management, and archival storage; analyzing large-scale datasets, developing code, and creating novel tools and methods for advanced data analysis; supporting ongoing research activities
-
://www.kth.se Postal Code 11428 STATUS: EXPIRED X (formerly Twitter) Facebook LinkedIn Whatsapp More share options E-mail Pocket Viadeo Gmail Weibo Blogger Qzone YahooMail
-
-coding RNA (lncRNA) genes in plant genomes. The Knut and Alice Wallenberg Foundation (KAW) funds this two-year postdoctoral scholarship. The scholarship amounts to 348 000 SEK per year and is not subject
-
, demonstrated experience of coding in programming languages such as R and Python is considered particularly advantageous. Examples of computationally intensive methods central to IAS and IDA are data-driven text
-
, demonstrated experience of coding in programming languages such as R and Python is considered particularly advantageous. Examples of computationally intensive methods central to IAS and IDA are data-driven text
-
empirically validate how GenAI agents can assist software developers in tasks such as code generation, documentation, optimization, and human-AI interaction workflows. As a postdoctoral researcher, you will be
-
experiments to evaluate protein self-assembly. An ability to derive equations and writing code to analyze data on protein self-assembly. Practical experience in measuring protein size distributions and
-
the case, then the problem is further complicated by the fact that no single mapping is optimal for all combinations of matrix sizes. As a consequence, any code generated (at compile-time) to evaluate