Results 1  10
of
913
Optimal DepthFirst Strategies for AndOr Trees
, 2002
"... A probabilistic boolean expression (PBE) consists of a boolean expression over a set of boolean variables, each with a corresponding cost and probability value that indicates respectively the cost of determining a variable's value and the probability that the value is true. Given a PBE, a resol ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
and leaf nodes correspond to variables. We further assume that variables are independent, and focus on a depthfirst algorithm, dfa, that orders subexpressions within subtrees based on probability/cost ratios. Our main results are that dfa produces optimal strategies for andor trees with depth 1 or 2
Combining BreadthFirst and DepthFirst Strategies in Searching for Treewidth
"... Breadthfirst and depthfirst search are basic search strategies upon which many other search algorithms are built. In this paper, we describe an approach to integrating these two strategies in a single algorithm that combines the complementary strengths of both. We show the benefits of this approac ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Breadthfirst and depthfirst search are basic search strategies upon which many other search algorithms are built. In this paper, we describe an approach to integrating these two strategies in a single algorithm that combines the complementary strengths of both. We show the benefits
gSpan: GraphBased Substructure Pattern Mining
, 2002
"... We investigate new approaches for frequent graphbased pattern mining in graph datasets and propose a novel algorithm called gSpan (graphbased Substructure pattern mining) , which discovers frequent substructures without candidate generation. gSpan builds a new lexicographic order among graphs, and ..."
Abstract

Cited by 650 (34 self)
 Add to MetaCart
, and maps each graph to a unique minimum DFS code as its canonical label. Based on this lexicographic order, gSpan adopts the depthfirst search strategy to mine frequent connected subgraphs efficiently. Our performance study shows that gSpan substantially outperforms previous algorithms, sometimes
BestFirst and DepthFirst Minimax Search in practice
 Erasmus University, Rotterdam, The Netherlands and the University of Alberta
"... Abstract Most practitioners use a variant of the AlphaBeta algorithm, a simple depthfirst procedure, for searching minimax trees. SSS*, with its bestfirst search strategy, reportedly offers the potential for more efficient search. However, the complex formulation of the algorithm and its alleged ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract Most practitioners use a variant of the AlphaBeta algorithm, a simple depthfirst procedure, for searching minimax trees. SSS*, with its bestfirst search strategy, reportedly offers the potential for more efficient search. However, the complex formulation of the algorithm and its
An Analysis of Consecutively Bounded DepthFirst Search
"... Consecutively bounded depthfirst search involves repeatedly performing exhaustive depthfirst search with increasing depth bounds of 1, 2, 3, and so on. The effect is similar to that of breadthfirst search, but, instead of retaining the results at level n 1 for use in computing level n, earlier r ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
results are recomputed. Consecutively bounded depthfirst search is useful whenever a complete search strategy is needed and either it is desirable to minimize memory requirements or depthfirst search can be implemented particularly efficiently. It is notably applicable to automated deduction, especially
On a Simple DepthFirst Search Strategy for Exploring Unknown Graphs
 In Proceedings of the Workshop on Algorithms and Data Structures
, 1997
"... . We present a simple depthfirst search strategy for exploring (constructing) an unknown strongly connected graph G with m edges and n vertices by traversing at most min(mn;dn 2 +m) edges. Here, d is the minimum number of edges needed to add to G to make it Eulerian. This parameter d is known as ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
. We present a simple depthfirst search strategy for exploring (constructing) an unknown strongly connected graph G with m edges and n vertices by traversing at most min(mn;dn 2 +m) edges. Here, d is the minimum number of edges needed to add to G to make it Eulerian. This parameter d is known
Limited Assignments: A New Cutoff Strategy for Incomplete DepthFirst Search
 IN PROCEEDINGS OF THE 2005 ACM SYMPOSIUM ON APPLIED COMPUTING. ACM
, 2005
"... In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depthbounded backtrack search, credit search, and iterative broadening, towards producing incomplete solutions. We also propose a new cutoff strategy for incomplete depthfirst search motivated by a huma ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depthbounded backtrack search, credit search, and iterative broadening, towards producing incomplete solutions. We also propose a new cutoff strategy for incomplete depthfirst search motivated by a
Depthfirst Proof Search without Backtracking for Freevariable Clausal Tableaux
, 2002
"... We analyse the problem of constructing a deterministic proof procedure for freevariable clausal tableaux that performs depthfirst proof search without backtracking; and we present a solution based on a fairness strategy. That ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
We analyse the problem of constructing a deterministic proof procedure for freevariable clausal tableaux that performs depthfirst proof search without backtracking; and we present a solution based on a fairness strategy. That
A appraisal paper on Breadthfirst search, Depthfirst search and Red
"... Abstract Breadthfirst and depthfirst search are indispensable adventure strategies leading which many other rummage around algorithms are built. In this dissertation, we projected an loomed of integrating these two strategies in a solitary algorithm that combines the corresponding strengths of mu ..."
Abstract
 Add to MetaCart
Abstract Breadthfirst and depthfirst search are indispensable adventure strategies leading which many other rummage around algorithms are built. In this dissertation, we projected an loomed of integrating these two strategies in a solitary algorithm that combines the corresponding strengths
Workload balancing in highly parallel depthfirst search
 PROCS. SCALABLE HIGH PERFORMANCE COMPUTING CONF.
, 1994
"... Among the various approaches for parallel depthfirst search (DFS), the stacksplitting schemes are most popular. However, as shown in this paper, dynamical stacksplitting is not suitable for massively parallel systems with several hundred processors. Initial workload imbalances and work packets o ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
of dissimilar sizes cause a high communication overhead. We compare workload balancing strategies of two depthfirst searches and propose a scheme that uses finegrained fixedsized work packets. In its iterativedeepening variant (named AIDA*) the global workload distribution improves from one iteration
Results 1  10
of
913