نتایج جستجو برای: local branching algorithm
تعداد نتایج: 1252980 فیلتر نتایج به سال:
Abstract We prove a local Gan–Gross–Prasad conjecture on predicting the branching law for non-tempered representations of general linear groups in case non-Archimedean fields. also generalize to Bessel and Fourier–Jacobi models study possible generalization Ext-branching laws.
We study the longtime behaviour of interacting systems in a randomly uctuating (space{ time) medium and focus on models from population genetics. There are two prototypes of spatial models in population genetics: spatial branching processes and interacting Fisher{Wright diiusions. Quite a bit is known on spatial branching processes where the local branching rate is proportional to a random envi...
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
In the family of clustering problems we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges). The goal is to identify clusters of similar objects by slightly modifying the graph to obtain a cluster graph (disjoint union of cliques). Hüffner et al. [LATIN 2008, Theory Comput. Syst. 2010] initiated the parameterized study of Cluster Vertex ...
We study the interval completion problem, which asks for the insertion of a set of at most k edges to make a graph of n vertices into an interval graph. We focus on chordal graphs with no small obstructions, where every remaining obstruction is known to have a shallow property. From such a shallow obstruction we single out a subset 6 or 7 vertices, called the frame, and 5 missed edges in the su...
in a detection network, the final decision is made by fusing the decisions from local detectors. the objective of that decision is to minimize the final error probability. to implement and optimal fusion rule, the performance of each detector, i.e. its probability of false alarm and its probability of missed detection as well as the a priori probabilities of the hypotheses, must be known. howev...
This paper is an adaptation of a method used in [10] to the model of random quadrangulations. We prove local weak convergence of uniform measures on quadrangulations and show that the local growth of quadrangulation is governed by certain critical time-reversed branching process and the rescaled profile converges to the reversed continuous-state branching process. As an intermediate result we d...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید