Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
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...
In this paper we propose differential eligibility vectors (DEV) for temporal-difference (TD) learning, a new class of eligibility vectors designed to bring out the contribution of...
—Despite the range of applications and successes of evolutionary algorithms, expensive fitness computations often form a critical performance bottleneck. A preferred method of r...
Snakes, or active contours, are used extensively in computer
vision and image processing applications, particularly
to locate object boundaries. Problems associated with
initial...