We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
Developed using the principles of the Model-View-Controller architectural pattern, FolksEngine is a parametric search engine for folksonomies that allows us to test arbitrary sear...
Nicola Raffaele Di Matteo, Silvio Peroni, Fabio Ta...
Local genetic algorithms have been designed with the aim of providing effective intensiļ¬cation. One of their most outstanding features is that they may help classical local searc...
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...