We consider the problem of efficiently scheduling the production of goods for a model steel manufacturing company. We propose a new approach for solving this classic problem, using techniques from the statistical physics of complex networks in conjunction with depth-first search to generate a successful, flexible, schedule. The schedule generated by our algorithm is more efficient and outperfor...

If an iterative deepening search (IDS) procedure has the property that solutions at a given iteration are also found at later iterations, it is possible to skip iterations without loss of correctness. We examine the conditions required for skipping to be worthwhile and give an algorithm for dynamically adapting the skipping to the behaviour of the search procedure. We consider the problem f wit...

Iterative Bounding LAO* is a new algorithm for optimal probabilistic planning problems where an absorbing goal state should be reached at a minimum expected cost from a given initial state. The algorithm is based on the LAO* algorithm for finding optimal solutions in cyclic AND/OR graphs. The new algorithm uses two heuristics, one upper bound and one lower bound of the optimal cost. The search ...

Central Research Institute of Power Industry has developed a highly accurate and low cost flaw depth sizing technique which is easy-to-use in comparison to standard techniques such as crack tip diffraction and TOFD techniques. This technique is called the short path of diffraction (SPOD) technique. In this technique, an angle beam transducer and a 0-degree transducer are used to excite and rece...

We present the main ideas behind a new syntax-based machine translation system, based on reducing the machine translation task to a tree-labeling task. This tree labeling is further reduced to a sequence of decisions (of four varieties), which can be discriminatively trained. The optimal tree labeling (i.e. translation) is then found through a simple depth-first branch-andbound search. An early...

Perfect graphs, by definition, have a nice structure, that graph searching seems to extract in a, often non-inexpensive, manner. We scratch the surface of this elegant research area by giving two examples: Lexicographic Breadth Search on Chordal Graphs, and Lexicographic Depth First Search on Cocomparability graphs.

Minimal siphons play an important role in the development of deadlock control policies for discrete event system modeled by Petri net. A new algorithm based on depth-first search of problem decomposition process is proposed to compute all minimal siphons in an ordinary Petri net. The algorithm can reduce the number of problems in the problem list. The proposed algorithm can solve the problem of...

Many algorithms for computing minimal coverability sets for Petri nets prune futures. That is, if a new marking strictly covers an old one, then not just the old marking but also some subset of its successor markings is discarded from search. In this publication, a simpler algorithm that lacks future pruning is presented and proven correct. Its performance is compared with future pruning. It is...

We present an n-processor and O(lo~n)-time parallel RAM algorithm for finding a depth-first-search tree in an n·vertex planar graph. The algorithm is based on a new n-processor algorithm for finding a cyclic separator in a planar graph and Smith's original parallel depth-first-search algorithm for planar graphs [Smi86].

Search algorithms based on the notion of proof and disproof numbers have been shown to be effective in many games. In this paper, we modify the depth-first proof-number search algorithm df-pn, in order to apply it to the game of Go. We develop a solver for one-eye problems, a special case of enclosed tsume-Go [ life and death] problems. Our results show that this approach is very promising.