Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate...
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Illumination rendering including environment lighting, indirect illumination, and subsurface scattering plays for many graphics applications such as games and VR systems. However, ...
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
Basil Kouvaritakis, Mark Cannon, J. Anthony Rossit...
Two examples of open-loop differential games are considered in the paper. Starting with simplified dynamic Duel, further it was developed to differential economic Duel modelling pr...