نتایج جستجو برای: coloring agents

تعداد نتایج: 372335  

Journal: :Brazilian oral research 2013
Júlia Magalhães Costa Lima Lilian Costa Anami Marília Pivetta Rippe Renata Marques de Melo Marco Antonio Bottino Márcia Carneiro Valera Maria Amélia Máximo Araújo

The objective of this study was to evaluate the influence of different surface agents on the flexural strength of a ceramic system. Eighty bar-shaped specimens of zirconia were divided into four groups according to the agent to be used: group Control--to be cleaned with alcohol; group VM9--application of a fluid layer of porcelain; group Effect Bonder--application of a bonding agent; and group ...

Kh. Erfani S. Rahimi Sharbaf

‎For a coloring $c$ of a graph $G$‎, ‎the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively‎ ‎$sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$‎, ‎where the summations are taken over all edges $abin E(G)$‎. ‎The edge-difference chromatic sum‎, ‎denoted by $sum D(G)$‎, ‎and the edge-sum chromatic sum‎, ‎denoted by $sum S(G)$‎, ‎a...

2017
Raffaello Carosi Michele Flammini Gianpiero Monaco

We investigate approximate pure Nash equilibria in digraph k-coloring games, where we are given an unweighted directed graph together with a set of k colors. Vertices represent agents and arcs capture their mutual unidirectional interests. The strategy set of each agent v consists of the k colors and the payoff of v in a given state or coloring is given by the number of outgoing neighbors with ...

ژورنال: پژوهش های ریاضی 2022

The purpose of this study is to show how topological surfaces are painted in such a way that the colors are borderless but spaced with the lowest color number. That a surface can be painted with at least as many colors as the condition of defining a type of mapping with the condition that it has no fixed point. This mapping is called color mapping and is examined and analyzed in differe...

Journal: :Social Science Research Network 2021

Global coordination is required to solve a wide variety of challenging collective action problems from network colorings the tragedy commons. Recent empirical study shows that presence few noisy autonomous agents can greatly improve performance humans in solving networked color games. To provide further analytical insights into role behavioral randomness, here we myopic artificial attempt simil...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید