Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Services for locating mobile objects are often organized as a distributed search tree. The advantage of such an organization is that the service can easily scale as a distributed ...
Individual differences make it difficult to recognize similarities between individuals in eye movement patterns. However, if consistencies can be found, eye movements could be use...
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
In this paper we describe BR-4, a computational model of scienti c discovery in particle physics. The system incorporates operators for determining quantum values of known particle...