Automatically acquiring control-knowledge for planning, as it is the case for Machine Learning in general, strongly depends on the training examples. In the case of planning, examp...
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
Recently, there are active discussions on the possibility of non-invertible watermarking scheme. A non-invertible scheme prevents an attacker from deriving a valid watermark from a...
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...