In 2000 Alber et al. [SWAT 2000 ] obtained the ļ¬rst parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ā...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
The L2 cache is commonly managed using LRU policy. For workloads that have a working set larger than L2 cache, LRU behaves poorly, resulting in a great number of less reused lines...
Abstractā Research on humanoid robots for use in servicing tasks, e.g. fetching and delivery, attracts steadily more interest. With āRollinā Justinā a mobile robotic system...
Bernsteinās CubeHash is a hash function family that includes four functions submitted to the NIST Hash Competition. A CubeHash function is parametrized by a number of rounds r, a...
Jean-Philippe Aumasson, Eric Brier, Willi Meier, M...
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...