We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou­ sand time-tokens in demanding applications such as reactive planning and execution con­ trol. A system, called IxTeT, aiming at that goal is described. It uses an original represen­ tation of a lattice of time-points that relies for efficiency on a maximum spannin...

Let G = (V, E, w) be an undirected graph with nonnegative edge weight. For any spanning tree T of G, the weight of T is the total weight of its tree edges and the routing cost of T is ∑ u,v∈V dT (u, v), where dT (u, v) is the distance between u and v on T . In this paper, we present an algorithm providing a trade off among tree weight, routing cost and time complexity. For any real number α > 1...

Along with using geometric information to define spatial terms such as “in”, Coventry and Garrod (2004) have proposed the use of dynamic-kinematic (DK) routines which relate to how two objects interact (kinematic) over time (dynamic). For the spatial description, “The penny is in the bowl,” the penny is contained by a bounding box around the bowl as well as the DK location-control routine that ...

This paper presents a lower bound of Ω(D+ √ n/ logn) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of diameter D = Ω(logn), in the bounded message model. This establishes the asymptotic nearoptimality of existing time-efficient distributed algorithms for the problem, whose complexity is O(D + √ n log∗ n).

This paper proposes a novel method to develop a process response model from continuous time-series data. The main contribution of the research is to establish a method to mine a set of meaningful control rules from Learning Classifier System using the Minimum Description Length criteria. The proposed method has been applied to an actual process of a biochemical plant and has shown the validity ...

The Euclidean minimum spanning tree (EMST) is a fundamental and widely studied structure. In the approximate version we are given an n-element point set P in R and an error parameter ε > 0, and the objective is to compute a spanning tree over P whose weight is at most (1 + ε) times that of the true minimum spanning tree. Assuming that d is a fixed constant, existing algorithms have running time...

This note gives a short proof of a sampling lemma used by Karger, Klein, and Tatjan in the analysis of their randomized linear-time algorithm for minimum spanning trees.

A hidden guard set G is a set of point guards in polygon P that all points of the polygon are visible from some guards in G under the constraint that no two guards may see each other. In this paper, we consider the problem for finding minimum hidden guard sets in histogram polygons under orthogonal visibility. Two points p and q are orthogonally visible if the orthogonal bounding rectangle for ...

We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a continues region (Imprecise model) or a finite set of points (Indecisive model). Given a set of inexact points in one of Imprecise or Indecisive models, we wish to provide a lower-bound on the diameter...

iii