• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 22,742
Next 10 →

TABLE III: CPU RUNTIMES (IN SECONDS) ON SEARCH STRATEGIES depth-first breadth-first priority

in Abstract An Efficient Sequential SAT Solver With Improved Search Strategies
by F. Lu, M. K. Iyer, G. Parthasarathy, L. -c. Wang, K. -t. Cheng, K. C. Chen

Table 2. Results for depth-first (left) and breadth-first search(right).

in Trail-directed Java Program Verification
by Tilman Mehler, Stefan Edelkamp 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.

in Knowledge Intensive Word Alignment with KNOWA
by unknown authors

Table 2. Exploration results for depth-first search.

in External Program Model Checking
by Stefan Edelkamp, Shahid Jabbar, Dino Midzic, Daniel Rikowski, Damian Sulewski 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
by Jürgen Sauer, Bnemen Giermany, Stefan Edelkamp, Shahid Jabbar, Dino Midzic, Daniel Rikowski, Damian Sulewski, Thorsten Krebs, Lothar Hotz
"... 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 2.1: Depth-First Search

in CircularTrip and ArcTrip: Effective Grid Access methods . . .
by Muhammad Aamir Cheema

Table 4.2 Branch Depth-First Search Breadth-First Search

in Automatic Test Result Analysis for High-Level Specifications
by O. B. Bellal, G. V. Bochmann, M. Dubuc, F. Saba 1991
Cited by 4

Table V. Results for Testing SGLIB 1.0.1 with Bounded Depth-First Strategy with Depth 50

in Concolic testing of sequential and concurrent programs
by Koushik Sen, Darko Marinov, Gul Agha

Table V. Results for Testing SGLIB 1.0.1 with Bounded Depth-First Strategy with Depth 50

in Concolic testing of sequential and . . .
by Koushik Sen, Darko Marinov, Gul Agha

Table 1: Results of monitorability analysis for ASP scenario, with performance of depth-first search algorithm

in The monitorability of service-level agreements for application-service provision
by James Skene, Malet Place, Jason Crampton 2007
Cited by 3
Next 10 →
Results 1 - 10 of 22,742
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University