We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Artificial neural networks can be trained to perform excellently in many application areas. While they can learn from raw data to solve sophisticated recognition and analysis prob...
We study the combined problem of approximating a surface by a quad mesh (or quad-dominant mesh) which on the one hand has planar faces, and which on the other hand is aestheticall...
Mirko Zadravec, Alexander Schiftner, Johannes Wall...
This work studies optimal sensor placement and motion coordination strategies for mobile sensor networks. For a target tracking application with range sensors, we investigate the ...
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...