نتایج جستجو برای: cordial index set
تعداد نتایج: 1033313 فیلتر نتایج به سال:
Anouar Benhassena∗, Khalid Benabdeslem∗∗, Fazia Bellal∗∗, Alexandre Aussem∗∗ et Bruno Canitia∗∗∗ ∗ IRISA Projet CORDIAL 6, rue de Kerampont BP 447, 22305 Lannion Cedex, France [email protected] ∗∗Université Lyon1, UFR d’Informatique, LIESP 8, Avenue Niels Bohr, 69622 Villeurbanne Cedex, France {kbenabde, fbellal, aaussem}@bat710.univ-lyon1.fr ∗∗∗ VISOON 60, Avenue de Rockefeller, 6900...
We demonstrate, for the first time, high-speed circuits that generate partitions on a set S of n objects. We offer two versions. In the first, partitions are produced in lexicographical order in response to successive clock pulses. In the second, an index input determines the set partition produced. Such circuits are needed in the hardware implementation of the optimum distribution of tasks to ...
By Doob’s theorem, supermartingales indexed by the natural numbers decompose into the difference of a uniformly integrable martingale and an increasing process. The relative ease of working with increasing processes rather than supermartingales explains the prominent role of this result in stochastic analysis and in the theory of stochastic integration. Meyer [19] then proved that, under the us...
For a graph G = (V,E) and a binary labeling (coloring) f : V (G) → Z2, let vf (i) = |f−1(i)|. f is said to be friendly if |vf (1) − vf (0)| ≤ 1. The labeling f : V (G) → Z2 induces an edge labeling f∗ : E(G) → Z2 defined by f∗(xy) = |f(x)− f(y)| ∀xy ∈ E(G). Let ef (i) = |f∗−1(i)|. The friendly index set of the graph G, denoted by FI(G), is defined by FI(G) = {|ef (1)− ef (0)| : f is a friendly ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید