We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from...
We propose a new circularity measure inspired from Arkin [1], Latecki [9] tools of shape matching that is constructed in a tangent space. We then introduce a linear algorithm that...
We study returns in dynamical systems: when a set of points, initially populating a prescribed region, swarms around phase space according to a deterministic rule of motion, we sa...
Discrete-event (DE) models are formal system specifications that have analyzable deterministic behaviors. Using a global, consistent notion of time, DE components communicate via...