3204 search results - page 216 / 641 » The b-chromatic Number of a Graph |
CP
2009
Springer
14 years 11 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
JAL
2006
13 years 10 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
TCS
2008
13 years 10 months ago
2008
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
IROS
2009
IEEE
14 years 5 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...
IWOMP
2009
Springer
14 years 5 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...