نتایج جستجو برای: weighted logic metric
تعداد نتایج: 327475 فیلتر نتایج به سال:
It is known that Metric Temporal Logic (MTL) is strictly less expressive than the Monadic First-Order Logic of Order and Metric (FO[<,+1]) in the pointwise semantics over bounded time domains (i.e., timed words of bounded duration) [2]. In this paper, we present an extension of MTL, relying on two new temporal operators ‘Earlier’ (E) and ‘Newer’ (N), which has the same expressive power as FO[<,...
The semantics of logic programs is commonly deened as the least xed point of an appropriate meaning operator. In case of normal programs, however, some undesired results do occur and it has recently been suggested to apply metric methods in order to overcome these problems. We show in this paper that these metric methods can be directly implemented by recurrent connectionist networks giving ris...
The classical k nearest neighbor (k-nn) classification assumes that a fixed global metric is defined and searching for nearest neighbors is always based on this global metric. In the paper we present a model with local induction of a metric. Any test object induces a local metric from the neighborhood of this object and selects k nearest neighbors according to this locally induced metric. To in...
We present a new edge betweenness metric for undirected and weighted graphs. This metric is defined as the fraction of minimum spanning trees where a given edge is present and it was motivated by the necessity of evaluating phylogenetic trees. Moreover we provide results and methods concerning the exact computation of this metric based on the well known Kirchhoff’s matrix tree theorem.
In this paper, we provide a generalization of rectangular b-metric space by relaxing the inequality to include unequal weights. We examples and restrictions for Lipschitz constant enabling convergence some sequences in proof fixed point theorems.
The algorithm of fingerprint constructing for still images based on weighted image structure model is proposed. The error correcting codes that are perfect in weighted Hamming metric are used as a base for fingerprint constructing.
in this thesis we will present three topics. we define approximate fixed points in fuzzy normed spaces. also we obtain some necessary and sufficient conditions on the existence of? -fixed points for ? > 0. at the continue some results about approximate fixed points for a class of non-expansive maps on g-metric spaces are obtained and we define approximate fixed points in partial metric spa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید