Results 1 - 10
of
22,742
TABLE III: CPU RUNTIMES (IN SECONDS) ON SEARCH STRATEGIES depth-first breadth-first priority
Table 2. Results for depth-first (left) and breadth-first search(right).
2002
"... In PAGE 14: ... Depth-first search For depth-first search, we expect that it generally finds an error faster than the other strategies, but also returns the longest error trail. The left part of Table2 depicts the obtained results for the protocols we have selected. Our expectations proved true particularly in the leader-election protocol.... ..."
Cited by 1
Table 5: Wrong alignment caused by the first- depth search strategy in the word window 1-9.
Table 2. Exploration results for depth-first search.
2006
"... In PAGE 10: ... We observe that the step-optimal counterexample lies at depth 4 + 3p, where p is the number of philosophers. Depth-first search results are depicted in Table2 . The effect is that the ex- ploration can solve by far larger instances.... ..."
Cited by 1
Table 2. Exploration results for depth-first search.
in Outline
"... In PAGE 13: ... We observe that the step-optimal counterexample lies at depth 4 + 3p, where p is the number of philosophers. Depth-first search results are depicted in Table2 . The effect is that the ex- ploration can solve by far larger instances.... ..."
Table 4.2 Branch Depth-First Search Breadth-First Search
1991
Cited by 4
Table V. Results for Testing SGLIB 1.0.1 with Bounded Depth-First Strategy with Depth 50
Table V. Results for Testing SGLIB 1.0.1 with Bounded Depth-First Strategy with Depth 50
Table 1: Results of monitorability analysis for ASP scenario, with performance of depth-first search algorithm
2007
Cited by 3
Results 1 - 10
of
22,742