3757 search results - page 301 / 752 » The overlap number of a graph |
177
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...
185
click to vote
IWOMP
2009
Springer
16 years 1 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...
137
click to vote
DASFAA
2007
IEEE
16 years 1 months ago
2007
IEEE
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
163
click to vote
FOCI
2007
IEEE
16 years 1 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...
147
click to vote
IPPS
2007
IEEE
16 years 29 days ago
2007
IEEE
Previous work on scheduling dynamic competitive jobs is focused on multiprocessors configurations. This paper presents a new distributed dynamic scheduling scheme for sporadic re...