In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
— This paper presents Natural Evolution Strategies (NES), a novel algorithm for performing real-valued ‘black box’ function optimization: optimizing an unknown objective func...
Service Management controls how business services are developed and delivered to customers. Business services must be flexible negotiable between customer and provider. Temporal a...
— The rapidly increasing complexity of tasks robotic systems are expected to carry out underscores the need for the development of motion planners that can take into account disc...