Sort by
Refine Your Search
-
Listed
-
Category
-
Program
-
Employer
-
Field
-
machine. We develop quasi-Newton coupling algorithms for partitioned simulation of FSI, and we solve challenging FSI problems in the energy transition and in industry. This research is often in
-
to ensure reusability and scalability. To achieve this, you will work with high-fidelity simulation tools, machine learning algorithms, and experimental condition-monitoring systems (accelerometers, acoustic
-
algorithms need to be developed to determine the winners of the auction, as well as intermediate feedback that can be communicated to the bidders, to facilitate the bidding process. The market-based research
-
theoretical background for MIMO related research, and have attended courses such as Information Theory, Signal and Systems, Modulation and Detection. Experience with OFDM or single carrier baseband algorithms
-
and checked by an independent third party, and even (3) rigorous evaluation of algorithmic improvements.For some inspiration on this topic, see the CertiFOX project page: https://www.bartbogaerts.eu
-
machine learning (ML) models and optimization algorithms specifically designed for highly dynamic satellite communication (SatCom) systems that can handle networks of varying sizes and configurations
-
quasi-Newton coupling algorithms for partitioned simulation of FSI, and we solve challenging FSI problems in the energy transition and in industry. This research is often in collaboration with another
-
will design, implement, and validate novel algorithms, and benchmark them against state-of-the-art reconstruction pipelines. Strong programming skills (e.g., Python/C++ and GPU-based computing) and
-
, machine learning algorithms, and experimental condition-monitoring systems (accelerometers, acoustic emission sensors). WHAT WE ARE LOOKING FOR You have a strong interest in scientific and/or project-based
-
, high school timetabling, examination timetabling, master thesis defense assignments and scheduling and student project and master’s thesis assignments. For these problems, we wish to develop an algorithm