Sort by
Refine Your Search
-
Listed
-
Employer
-
Field
-
algorithms. The targeted starting date is 1 September 2025,or as soon as possible thereafter. Project description This project will explore the algorithms, advantages, and applications of quantum computing
-
: Odense, 5230, Denmark [map ] Subject Areas: mathematical theory, algorithm development, error correction, adaptation of GBS-based algorithms to other quantum computing platforms, and the development
-
of Science and Technology (NTNU) offers a joint 3-year PhD fellowship. Novel non-target chemical analyses have recently revealed that groundwater and drinking water are contaminated from PFAS, pesticide and
-
experimentation with Asst. Prof. Eli N. Weinstein. Your goal will be to develop fundamental algorithmic techniques to overcome critical bottlenecks on data scale and quality, enabling scientists to gather vastly
-
agricultural robotics and new sustainable farming practices. The PhD projects will be combining new sensor systems and perception algorithms. So, if you are one of the 2 selected applicants, your primary
-
algorithms. Graph Neural Networks. The candidate is expected to hold a relevant MSc degree in Computer Science, Data Science, Physics, (Applied) Mathematics, Computational Statistics or another field
-
achieve automated data driven optimization (in terms of time and quality) of polishing process parameters by application of machine learning algorithms, leading to a robust, repeatable and fast polishing
-
thus including sensing systems, tool condition features selection, algorithms for automated signal preprocessing, feature extraction and decision making based on ML and AI. An integral part of
-
properties of skeletal muscle during static and dynamic contractions. The student will also participate in early-stage algorithmic work to model muscle architecture and behavior across contraction types. In
-
achieve automated data driven optimization (in terms of time and quality) of polishing process parameters by application of machine learning algorithms, leading to a robust, repeatable and fast polishing