We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
Abstract— This paper presents a novel, computationally feasible procedure for computing optimal switching surfaces, i.e. optimal feedback controllers for switched autonomous nonl...
Axel Schild, Xu Chu Ding, Magnus Egerstedt, Jan Lu...
— Particle swarm optimization (PSO) is a stochastic global optimization algorithm inspired by social behavior of bird flocking in search for food, which is a simple but powerful...