Sort by
Refine Your Search
-
Country
-
Employer
-
Field
-
: Excellent Master’s degree (or equivalent) in computer science, engineering, or related disciplines (typically mathematics, physics). For Postdoc applicants: Excellent track record in computer
-
Fritz Haber Institute of the Max Planck Society, Berlin | Berlin, Berlin | Germany | about 1 month ago
to learn and master novel computational approaches Solid experience in Python programming is required Collaborative spirit, teamwork, and excellent English skills We offer An attractive, diverse work
-
computer science, bioinformatics or related fields Solid understanding of machine and deep learning and relevant frameworks (e.g. Pytorch or Tensorflow, Keras, scikit-learn, OpenCV) Proficiency in Python, Linux and
-
program including development and review of research guides. Support the Libraries’ Key Performance Indicators (KPIs) and other strategic initiatives. Support efforts to maintain R1 and obtain Top 100
-
, the China Scholarship Council (CSC) and the DAAD have offered a joint programme to support Chinese postdocs since 2013. Who can apply? Outstanding graduates from Chinese Universities and institutes. What can
-
Overview On this page Objective The Canada Postdoctoral Research Award (CPRA) program recognizes and supports the next generation of outstanding innovators, knowledge workers, creative thinkers and
-
technologies to fundamental physics questions. The advertised positions will be part of the project “QS-Gauge: quantum simulation of lattice gauge theories”, funded by the Emmy Noether programme of the DFG
-
Engineering, Computer Engineering, Computer Science, or a closely related field Strong background in robotics fundamentals: kinematics, dynamics, control, planning Proficiency in programming (C++, Python), and
-
) Division of Program Coordination, Planning and Strategic Initiatives, Office of Research Infrastructure Programs (ORIP ) Special Note: Not all NIH Institutes and Centers participate in Parent Announcements
-
that algorithmic parameters are tuned so that the over-approximation of the computed reachable set is small enough to verify a given specification. We will demonstrate our approach not only on ARCH benchmarks, but