—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, En...
This technical report illustrates the differences in solving the optimal path problem (shortest path) using different methods, where the underlying PDE can be described by the eik...
We address the alignment of a group of images with simultaneous
registration. Therefore, we provide further insights
into a recently introduced class of multivariate similarity
...
Christian Wachinger (TU Munich), Nassir Navab (TU ...