With the growing size of publicly available XML document collections, fast keyword search becomes increasingly important. We present an indexing and keyword search technique that is suitable for DAGcompressed data and has the advantage that common subtrees have to be searched only once. We also present a performance evaluation that shows that our DAGcompressed index and search technique is supe...

In this paper, a new search technique over numeric csps is presented: dynamic domain splitting. The usual search technique over numeric csps is a dichotomic search interleaved with a consistency ltering, which is called domain splitting. This paper proposes to replace chronological backtracking at the core of domain splitting by a non destructive backtracking technique.

A novel minimization technique was developed. The proposed method is based on a Gaussian random search in the parameter space and it can handle wide range of problems, including bi-exponential curve fitting, reasonable time. It uses only function values, does not require gradients.