Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
The ability to construct CAD or other object models from edge and range data has a fundamental meaning in building a recognition and positioning system. While the problem of model...
— Gaussian models are widely adopted in continuous Estimation of Distribution Algorithms (EDAs). In this paper, we analyze continuous EDAs and show that they don’t always work ...
— The principle of artificial curiosity directs active exploration towards the most informative or most interesting data. We show its usefulness for global black box optimizatio...
Tom Schaul, Yi Sun, Daan Wierstra, Faustino J. Gom...