We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
Speculative prefetching has been proposed to improve the response time of network access. Previous studies in speculative prefetching focus on building and evaluating access models...
Nor Jaidi Tuah, Mohan Kumar, Svetha Venkatesh, Saj...
Abstract— This paper describes a new algorithm for cooperative and persistent simultaneous localization and mapping (SLAM) using multiple robots. Recent pose graph representation...
Been Kim, Michael Kaess, Luke Fletcher, John J. Le...
Abstract. Establishing correspondence between features of a set of images has been a long-standing issue amongst the computer vision community. We propose a method that solves the ...
good data partitioning scheme is the need of the time. However it is very diflcult to arrive at a good solution as the number of possible dutupartitionsfor a given real lifeprogra...