The paper describes results of minimax tree searching algorithm implemented within CUDA platform. The problem regards move choice strategy in the game of Reversi. The parallelization scheme and performance aspects are discussed, focusing mainly on warp divergence problem and data transfer size. Moreover, a method of minimizing warp divergence and performance degradation is described. The paper ...

Naturalness of warping is gaining extensive attention in image stitching. Recent warps such as SPHP, AANAP and GSP, use a global similarity to effectively mitigate projective distortion (which enlarges regions), however, they necessarily bring in perspective distortion (which generates inconsistency). In this paper, we propose a quasi-homography warp, which balances perspective distortion again...

Parallel discrete event simulation is a useful technique to improve performance of sequential discrete event simulation. We consider the Time Warp algorithm for asynchronous distributed discrete event simulation. Time Warp is an optimistic synchronization mechanism for asynchronous distributed systems that allows a system to violate the synchronisation constraint and, in this case, make the sys...