This paper presents a general framework for the design and randomized analysis of geometric algorithms. These algorithms are on-line and the framework provides general bounds for their expected space… (More)

Given a set of n elements each of which is either red or blue, it is known that in the worst case n − ν(n) pairwise equal/not equal color comparisons are necessary and sufficient to determine the… (More)

We consider the following problem: Given ordered labeled trees S and T can S be obtained from T by deleting nodes? Deletion of the root node u of a subtree with children $(T_1, \ldots,T_n)$ means… (More)

We investigate the use of cooperation between solvers in the scheme of constraint logic programming languages over the domain of non-linear polynomial constraints. Instead of using a general and… (More)

The deployment strategy for achieving differentiated coverage and probabilistic connectivity in wireless sensor networks is studied in this paper. A novel solution based on elitist non-dominated… (More)

By introducing an unconventional realization of the Poincaré algebra alt1 of special relativity as conformal transformations, we show how it may occur as a dynamical symmetry algebra for ageing… (More)

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research… (More)