“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
In this paper, we consider a set of HTTP flows using TCP over a common drop-tail link to download files. After each download, a flow waits for a random think time before reques...
Abstract. Spatially structured population models improve the performance of genetic algorithms by assisting the selection scheme in maintaining diversity. A significant concern wi...
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
Sven Oliver Krumke, Willem de Paepe, Diana Poensge...