This work introduces the idea of breadth-first generation of infinite trees and languages. It is orthogonal to usual descriptions by classical objects such as automata and grammars which refer more naturally to a depth-first approach. This idea is brought into play with periodic inputs, a case that comes from the study of rational base number systems which correspond to specific inputs derived ...

Identification and characterization of gene regulatory binding motifs is one of the fundamental tasks toward systematically understanding the molecular mechanisms of transcriptional regulation. Recently, the problem has been abstracted as the challenge planted (l,d)-motif problem. Previous studies have developed numerous methods to solve the problem. But most of them need to specify the length ...

A temporal graph is a graph in which connections between vertices are active at specific times, and such temporal information leads to completely new patterns and knowledge that are not present in a non-temporal graph. In this paper, we study traversal problems in a temporal graph. Graph traversals, such as DFS and BFS, are basic operations for processing and studying a graph. While both DFS an...

Move pruning is a low-overhead technique for reducing the size of a depth first search tree. The existing algorithm for automatically discovering move pruning information is restricted to games where all moves can be applied to every state. This paper demonstrates an algorithm which handles a general class of single player games. It gives experimental results for our technique, demonstrating bo...

This paper has three main contributions to our understanding of fixed-depth minimax search: (A) A new formulation for Stockman’s SSS* algorithm, based on Alpha-Beta, is presented. It solves all the perceived drawbacks of SSS*, finally transforming it into a practical algorithm. In effect, we show that SSS* = α-β + transposition tables. The crucial step is the realization that transposition tabl...

This paper has three main contributions to our understanding of fixed-depth minimax search: (A) A new formulation for Stockman’s SSS* algorithm, based on Alpha-Beta, is presented. It solves all the perceived drawbacks of SSS*, finally transforming it into a practical algorithm. In effect, we show that SSS* = + transposition tables. The crucial step is the realization that transposition tables c...

Measurements of the width of the radio bridge at several locations along the bridge for each of four powerful extended radio sources are presented. Adopting a few simple assumptions, these measurements may be used to predict the radio surface brightness as a function of position across the radio bridge. The predicted and observed surface brightnesses across the bridges are compared and found to...

A non-crossing tree (NC-tree) is a tree drawn on the plane having as vertices a set of points on the boundary of a circle, and whose edges are straight line segments that do not cross. In this paper, we show that NC-trees with size n are conditioned Galton–Watson trees. As corollaries, we give the limit law of depth-first traversal processes and the limit profile of NC-trees.

We introduce a variable depth search branching, an extension to the local branching for solving Mixed-Integer Programs. Two strategies are assessed, a best improvement strategy and a first improvement strategy. The extensive computational assessment evidences a significant improvement over the local branching for both strategies.

A new procedure, called DDα-procedure, is developed to solve the problem of classifying d-dimensional objects into q ≥ 2 classes. The procedure is completely nonparametric; it uses q-dimensional depth plots and a very efficient algorithm for discrimination analysis in the depth space [0, 1] . Specifically, the depth is the zonoid depth, and the algorithm is the α-procedure. In case of more than...