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
-
and condition-monitoring experts, ensuring a multidisciplinary environment. The project aims to develop high-fidelity dynamic multi-body simulation (MBS) models with elastic bodies and elasto
-
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
-
intelligence. In these research areas we focus on 1) foundations, 2) system design, and 3) applications. IDLab collaborates with many universities and research centres worldwide and jointly develops advanced
-
* for combinatorial solving; some details can be found below. The field of combinatorial optimization is concerned with developing generic tools that take a declarative problem description and automatically compute
-
refer to https://www.uni.lu/snt-en/research-groups/sigcom/ . Your role The successful candidate will join the SIGCOM Research Group, led by Prof. Symeon Chatzinotas. This PhD project aims to develop
-
-structure interaction (FSI) with focus on the fluid mechanics. We couple computational fluid dynamics (CFD) to a structural solver and/or a controller for the detailed simulation of a machine. We develop
-
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
-
models. The project involves close collaboration with experimental facilities as well as simulation and condition-monitoring experts, ensuring a multidisciplinary environment. The project aims to develop
-
, 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