We introduce new anytime search algorithms that combine best-first with depth-first search into hybrid schemes for Marginal MAP inference in graphical models. The main goal is to facilitate the generation of upper bounds (via the bestfirst part) alongside the lower bounds of solutions (via the depth-first part) in an anytime fashion. We compare against two of the best current state-of-the-art s...

Let G be a 3-connected graph on more than 4 vertices. We show that every depth-first-search tree of G contains a contractible edge. Moreover, we show that if G is 3-regular or does not have two disjoint pairs of adjacent degree-3 vertices, every spanning tree of G contains a contractible edge.

Experimental studies have shown that fungi use a natural program for searching the space available in micro-confined networks, e.g., mazes. This natural program, which comprises two subroutines, i.e., collision-induced branching and directional memory, has been shown to be efficient compared with the suppressing one, or both subroutines. The present contribution compares the performance of the ...

• A novel and efficient semi-external DFS algorithm EP-DFS is presented. requires simpler CPU calculation less memory space. index devised to reduce the disk random accesses. Extensive experiments are conducted on both real synthetic datasets . As graphs grow in size, many real-world difficult load into primary of a computer. Thus, computing depth-first search (DFS) results (i.e., order or DFS-...

This paper introduces a new paradigm for minimax game-tree search algorithms. MT is a memory-enhanced version of Pearl’s Testprocedure. By changing the way MT is called, a number of best-first game-tree search algorithms can be simply and elegantly constructed (including SSS*). Most of the assessments of minimax search algorithms have been based on simulations. However, these simulations genera...

Maximal frequent itemsets (MFI) are crucial to many tasks in data mining. Since the MaxMiner algorithm first introduced enumeration trees for mining MFI in 1998, there have been several methods proposed to use depth first search to improve performance. To further improve the performance of mining MFI, we proposed a technique to gather and pass tail (of a node) information to determine the next ...

Capture search, an expensive part of any chess program, is conducted at every leaf node of the approximating game tree. Often an exhaustive capture search is not feasible, and yet limiting the search depth compromises the result. Our experiments confirm that for chess a deeper search results in less error, and show that a shallow search does not provide significant savings. It is therefore bett...

We present an algorithm that exploits the complimentary benefits of best-first search (BFS) and depth-first search (DFS) by performing limited DFS lookaheads from the frontier of BFS. We show that this continuum requires significantly less memory than BFS. In addition, a time speedup is also achieved when choosing the lookahead depth correctly. We demonstrate this idea for breadth-first search ...

We present the application of Genetic Programming (GP) in Branch and Bound (B&B) based Mixed Integer Linear Programming (MIP). The hybrid architecture introduced employs GP as a node selection expression generator: a GP run, embedded into the B&B process, exploits the characteristics of the particular MIP problem being solved, evolving a problem-specific node selection method. The evolved metho...

In this paper, general guidelines and specific algorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm has time and space complexities in OðlÞ, where l is the length of the code of a BF or DF linear quadtree. 2002 Elsevier Science B.V. All rights reserved.