We introduce an inductive logic programming approach that combines classical divide-and-conquer search with modern constraint-driven search. Our anytime can learn optimal, recursive, and large programs supports predicate invention. experiments on three domains (classification, general game playing, program synthesis) show our increase predictive accuracies reduce learning times.

The paper provided a description of a new model of information retrieval, which is an extension of vector-space model and is based on the principles of the theory of hypercomplex numerical systems. The model allows to some extent realize the idea of fuzzy search and allows you to apply in practice the model of information retrieval practical developments in the field of hypercomplex numerical s...

Due to the widespread applicability and use of normal distribution, a need has arisen approximate its cumulative distribution function (cdf). In this article, five new simple approximations standard cdf are developed. order assess accuracy proposed approximations, both maximum absolute error mean were used. The errors lie between 0.00095 0.00946, which is highly accurate if compared existing qu...

We develop a randomized approximation algorithm for the size of set union problem |A1∪A2∪...∪Am|, which is given list sets A1,...,Am with approximate mi Ai mi∈((1−βL)|Ai|, (1+βR)|Ai|), and biased random generators probability Prob(x=RandomElement(Ai))∈[1−αL|Ai|,1+αR|Ai|] each input element x∈Ai, where i=1,2,...,m αL,αR,βL,βR∈(0,1). The ratio |A1∪A2∪...∪Am| in range [(1−ϵ)(1−αL)(1−βL),(1+ϵ)(1+αR...

in this paper, using the best proximity theorems for an extensionof brosowski's theorem. we obtain other results on farthest points. finally, wedene the concept of e- farthest points. we shall prove interesting relationshipbetween the -best approximation and the e-farthest points in normed linearspaces (x; ||.||). if z in w is a e-farthest point from an x in x, then z is also a-best ...