We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
: Collaborative querying seeks to help users formulate an accurate query to a search engine by sharing expert knowledge or other users' search experiences. One approach to acc...
Lin Fu, Dion Hoe-Lian Goh, Schubert Shou-Boon Foo,...
In this paper, we propose a recursive method for structural learning of directed acyclic graphs (DAGs), in which a problem of structural learning for a large DAG is first decompos...