1434 search results - page 77 / 287 » Graph Searching with Advice |
DAC
1998
ACM
14 years 9 months ago
1998
ACM
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...
IWOMP
2009
Springer
14 years 3 months ago
2009
Springer
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...
FOCI
2007
IEEE
14 years 3 months ago
2007
IEEE
— 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...
ISTA
2004
13 years 10 months ago
2004
: 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...
JMLR
2008
13 years 8 months ago
2008
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...