Sort by
Refine Your Search
-
Category
-
Country
-
Program
-
Field
-
for non-terrestrial communication o Model LEO satellite and UAV communication and exposure AI based algorithms to optimize the performance of integrated terrestrial and non-terrestrial networks (coverage
-
different incentives, mechanisms and regulatory scenarios, evaluating their performance with respect to different objectives and their trade-offs. Developing decentralized and bi-level algorithms to help
-
that amplify human potential. The successful candidate will engage in innovative research projects in ML, focusing on developing novel ML algorithms, enhancing human-AI collaboration, and exploring systems
-
in innovative research projects in ML, focusing on developing novel ML algorithms, enhancing human-AI collaboration, and exploring systems tailored to dynamic, human-centered environments. They may
-
; • popularisation of the results and other forms of dissemination. Competition rules Announcement reference number SOB/D110/2026/02/50-0305581 Keywords Informatics, Mathematical logic, Algorithms, Combinatorial
-
logic, Algorithms, Combinatorial analysis Deadline for submitting applications: 21 August 2026 Method of submitting an application to apply for the position, candidate should send an email entitled
-
include developing algorithms for ultra-fast force feedback and providing open SDKs and APIs for developers. Your Responsibilities Requirements Analysis: Assist in gathering requirements and translating
-
mathematical structures and computational algorithms underlying modern machine learning and artificial intelligence. Relevant themes include geometric and algebraic methods for learning, structure-preserving
-
for building energy-efficient and robust brain-inspired, autonomous, and cognitive systems and intelligent vision systems, including efficient learning and inference of complex AI/ML algorithms, specialized
-
user studies, develop novel algorithms, build immersive/augmented realities, and validate your solutions in real-world settings. This PhD is ideal for candidates interested in one or more of the