Sort by
Refine Your Search
-
Listed
-
Category
-
Country
- United States
- United Kingdom
- Germany
- Australia
- Singapore
- Spain
- Netherlands
- Austria
- France
- Belgium
- Canada
- Sweden
- Switzerland
- Italy
- Denmark
- Poland
- Portugal
- United Arab Emirates
- Finland
- Japan
- Morocco
- China
- Malta
- Hong Kong
- New Zealand
- Romania
- Luxembourg
- Croatia
- Czech
- Egypt
- Greece
- Norway
- Saudi Arabia
- Andorra
- Brazil
- Bulgaria
- India
- Ireland
- Armenia
- Cyprus
- Estonia
- Slovakia
- South Africa
- Worldwide
- 34 more »
- « less
-
Program
-
Field
-
cohorts and data generation resources through highly collaborative clinical faculty. Ideal candidates will have expertise in computational modeling, machine learning, or algorithm development, with
-
4 Nov 2025 Job Information Organisation/Company UNIVERSITE DE TECHNOLOGIE DE COMPIEGNE Department Computer Engineering Research Field Mathematics » Algorithms Researcher Profile First Stage
-
6 Dec 2025 Job Information Organisation/Company CNRS Department CNRS Research Field Computer science Mathematics » Algorithms Researcher Profile First Stage Researcher (R1) Country France
-
Engineer with strong experience in learning-based control and mobile manipulation. The successful candidate will work on algorithm development for contact-rich robotic manipulation, integrating perception
-
learning algorithms constitutes a very promising research direction for energy-efficient and Edge AI applications: the goal here is to make these systems capable of learning per se, not just inference
-
to the success of the whole institution. The Faculty of Computer Science, Institute of Theoretical Computer Science, the newly established Chair of Algorithmic and Structural Graph Theory offers a position as
-
a competition for the position of postdoctoral position (assistant professor) in the NCN Sonata-18 project entitled: Parallel and exact algorithms for path problems in directed graphs. About the
-
algorithms for exploratory network analysis. Our methodology focuses on robust heterogeneous graph analytics, designing temporal/dynamic data structures for motif extraction and data stream clustering
-
of the constraints on sequencing (read length, depth), and informatics (e.g., database composition, algorithm biases). Proposals should address these challenges with strategies to evaluate the metagenomic
-
algorithm development, numerical methods, or high-performance computing. Proficiency required in Python/C++ and scientific libraries (e.g., NumPy, SciPy). MATLAB is also desirable. Bonus: Familiarity with X