Sort by
Refine Your Search
-
Category
-
Program
-
Employer
-
Field
-
Advertisement for the field of study such as: Automation technology, electrical engineering, computer science, cybernetics, mechatronics, control engineering, software design, software engineering
-
, their achievements and productivity to the success of the whole institution. The Faculty of Computer Science, Institute of Theoretical Computer Science, the Chair of Algorithms offers a position as Research Associate
-
Development: Cell setup in sim and real: build a digital twin in Isaac Sim/Lab for the robot cell; mirror the real setup with matching kinematics, collision geometries, and dynamics. Algorithm Implementation
-
Stud. assistant (m/f/d) - Obj. Detection in clutter and Obj. Tracking in robotic hand (in Heilbronn)
, computer science, robotics or comparable. Reliable and precise perception is essential for robot-based bin picking and assembly, especially for bulk goods and object manipulation with robotic hands
-
: build a digital twin in Isaac Sim/Lab for the robot cell; mirror the real setup with matching kinematics, collision geometries and dynamics Algorithm Implementation: Develop and deploy reinforcement
-
Student assistant (m/f/d)-Multi-Modal Sensor Fusion, Object Detection in Clutter and Object Tracking
, computer science, robotics or comparable. Reliable and precise perception is essential for robot-based bin picking and assembly, especially for bulk goods and object manipulation with robotic hands
-
PhD Position in Theoretical Algorithms or Graph and Network Visualization - Promotionsstelle (m/w/d)
interfaces. Topics of interest include: Planar and geometric graph algorithms Approximation and parameterized algorithms Clustering, embeddings, and structural graph theory Computational complexity and
-
, collaborating with several research groups working in related fields, particularly in algebraic geometry and algorithmic algebra. For more information about the TUM Department of Mathematics, please visit our
-
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