Sort by
Refine Your Search
-
Listed
-
Category
-
Country
- United States
- United Kingdom
- Germany
- Australia
- Singapore
- Spain
- Netherlands
- France
- Sweden
- Austria
- Belgium
- Canada
- Italy
- Denmark
- Switzerland
- Poland
- Portugal
- United Arab Emirates
- China
- Japan
- Morocco
- Finland
- Hong Kong
- Malta
- Norway
- Croatia
- Romania
- Luxembourg
- New Zealand
- Czech
- Greece
- Ireland
- Saudi Arabia
- Andorra
- Bulgaria
- Egypt
- India
- South Africa
- Armenia
- Brazil
- Cyprus
- Estonia
- Slovakia
- Taiwan
- Worldwide
- 35 more »
- « less
-
Program
-
Field
-
-focused hardware accelerators, FPGAs, optimized low-level algorithms, and experimental compilers. Duties: Execute on tasking given to support ongoing projects within the Advanced Computing Lab, which could
-
covers theory and algorithms for goal-oriented, semantics-aware communication that enable efficient, intelligent, and adaptive information exchange in autonomous systems. The particular focus
-
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
-
? Not funded by a EU programme Is the Job related to staff position within a Research Infrastructure? No Offer Description The project consists in the development of algorithms for the indirect estimation
-
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
-
post-training mechanisms, specifically "Behavioral Priming" and "Insight Exhibition Rewards," to align models with interpretable reasoning criteria. Develop and implement software prototypes, algorithms
-
University of Warsaw: Faculty of Mathematics, Informatics and Mechanics | Poland | about 1 month ago
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
-
the robot and sensors. You will evaluate the methods for completeness, robustness, and runtime on representative datasets and iteratively improve both the setup and the algorithms. What you contribute Very
-
guarantee that what one believes to be one’s secrets will remain secret. Namely, a DP algorithm cannot ensure that private attributes cannot be inferred from publicly observable attributes if they have strong
-
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