The task of artificial intelligence is to provide representation techniques for describing problems, as well as search algorithms that can be used to answer our questions. A widespread and elaborated model is state-space representation, which, however, has some shortcomings. Classical search algorithms are not applicable in practice when the state space contains even only a few tens of thousand...

Recently work on technological change has emphasized the importance and implications of di¤erent knowledge bases among industries in terms of innovative potential. In some industries, products and processes have become more complex, as well as there appears to be increased convergence in some market segments. Although increasing attention has been given to features of knowledge bases, there hav...

The breadth-rst manipulation technique has proven eeective in dealing with very large sized BDDs. However , till now the lack of dynamic variable reordering has remained an obstacle in its acceptance. The goal of this work is to provide eecient techniques to address this issue. After identifying the problems with implementing variable swapping (the core operation in dynamic reordering) in bread...

This paper suggests a novel segmentation algorithm for separating moving objects from the background in video sequences without any prior information of the sequence nature. We formulate the problem as a connectivity analysis of region adjacency graph (RAG) based on temporal information. The nodes of the RAG represent homogeneous regions and the edges represent temporal information, which is ob...

In this paper, we present a disassemble-and-pack approach for a mechanism to seek a box which contains total mechanical parts with high space utilization. Its key feature is that mechanism contains not only geometric shapes but also internal motion structures which can be calculated to adjust geometric shapes of the mechanical parts. Our system consists of two steps: disassemble mechanical obje...

Scientific journal publications, and their contributions to knowledge, can be described by their depth (specialized, domain-specific knowledge extensions) and breadth (topical scope, including spanning multiple knowledge domains). Toward generating hypotheses about how scientists' personal dispositions would uniquely predict deeper vs. broader contributions to the literature, we assumed that co...

The recall of previously studied items is widely believed to incorporate a search of a markedly constrained set of possibilities, and the present study examines whether this set of items typically includes unstudied semantic associates of the study items. In an episodic task, participants recalled a previously studied list of eight exemplars drawn from a small or large category, and, in a seman...

Recent attempts at modeling humans' abilities at processing natural language have centered around depth first parsing algorithms, and control strategies for making the best choices for disambiguation and attachment. This paper proposes a breadth-first algorithm as a model. The algorithm avoids some of the common pitfalls of depth-first approaches regarding ambiguity, and by using more pre-ccmpu...