نتایج جستجو برای: embedding
تعداد نتایج: 73498 فیلتر نتایج به سال:
In this paper, we first establish a version of the central limit theorem for double sequence {pi(n)} that satisfies linear recurrence relation. Then find and prove under some commonly observed conditions, embedding distributions an H-linear family graphs with spiders is asymptotic to normal distribution. Applications are given well-known path-like ring-like sequences graphs. We also Euler-genus...
In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...
A greedy embedding of a graph G = (V, E) into a metric space (X, d) is a function x : V (G) → X such that in the embedding for every pair of non-adjacent vertices x(s), x(t) there exists another vertex x(u) adjacent to x(s) which is closer to x(t) than x(s). This notion of greedy embedding was defined by Papadimitriou and Ratajczak (Theor. Comput. Sci. 2005), where authors conjectured that ever...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید