" Das eben geschieht den Menschen, die in einem Irrgarten hastig wer-den: Eben die Eile führt immer tiefer in die Irre. " — Lucius Annaeus Seneca (4 n. Chr. – 65 n. Chr.) hierzu stellt die Tiefensuche (englisch depth-first search) dar, die wir nachfol-gend genauer betrachten wollen.

Developing previous work by R.C. Bose, R.M. Wilson, M. Greig and the author, we give a general construction for di erence families over nite elds. All the DFs constructed before were generated by a single initial base block so that they were uniform. Here we also consider DFs generated by two or more initial base blocks. These DFs give rise to pairwise balanced designs which of course are balan...

We show that the discrete Heisenberg group has unbounded deadend depth with respect to every finite generating set. We also show that, in contrast, it has bounded retreat depth.

This paper performs the first investigation into depth for large-scale human action recognition in video where the depth cues are estimated from the videos themselves. We develop a new framework called depth2action and experiment thoroughly into how best to incorporate the depth information. We introduce spatio-temporal depth normalization (STDN) to enforce temporal consistency in our estimated...

In a programming project, it is easy to lose track of which files need to be reprocessed or recompiled after a change is made in some part of the source. Make provides a simple mechanism for maintaining up-to-date versions of programs that result from many operations on a number of files. It is possible to tell Make the sequence of commands that create certain files, and the list of files that ...

Due to unforeseen problems, disruptions occur at railway passenger operators. Proper real-time crew management is needed to prevent disruptions to spread over space and time. Netherlands railways (NS) has algorithmic support from a solver to obtain good crew rescheduling solutions during big disruptions. However, small disruptions are still manually solved by human dispatchers who have limited ...

Many search trees are impractical ly large to explore exhaustively. Recently, techniques like l imi ted discrepancy search have been proposed for improving the chance of f inding a goal in a l imi ted amount of search. Depth-bounded discrepancy search offers such a hope. The motivat ion behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top o...

We generalize the QSQR evaluation method to give a setoriented depth-first evaluation method for Horn knowledge bases. The resulting procedure closely simulates SLD-resolution (to take advantages of the goal-directed approach) and highly exploits set-at-a-time tabling. Our generalized QSQR evaluation procedure is sound, complete, and tight. It does not use adornments and annotations. To deal wi...

The purpose of this research was to apply machine learning techniques to automate rule generation in the construction of Intelligent Tutoring Systems. By using a pair of somewhat intelligent iterative-deepening, depth-first searches, we were able to generate production rules from a set of marked examples and domain background knowledge. Such production rules required independent searches for bo...

This paper continues the research on determining a maximum cardinality set of edgeand node-disjoint paths between a source cell and a target cell in P systems. We review the previous solution [3], based on depth-first search (DFS), and we propose a faster solution, based on breadth-first search (BFS), which leverages the parallel and distributed characteristics of P systems. The runtime complex...