نتایج جستجو برای: coloring based
تعداد نتایج: 2944778 فیلتر نتایج به سال:
Mindfulness has been associated with the use of coloring books for adults; however, the question of whether they do increase mindfulness has not been addressed. In two studies, we attempted to identify whether mindfulness is increased, and whether there is a need for ongoing guidance while coloring, similar to mindfulness meditation. In the first randomized controlled experiment, university stu...
Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian and Hessian matrices using either finite differences or automatic differentiation. Several coloring problems occur in this context, depending on whether the matrix is a Jacobian or a Hessian, and on the specifics of the computational techniques employed. We consider eight variant vertex coloring problems her...
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer intervals in the range 1 to n and a set of m associated multisets of colors (specifying for each interval the colors to be used for its elements), one asks whether there is a “consistent” coloring for all integer points fro...
Abstract. In a multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (Mobile Computing and Communications Review 2004, INFOCOM 2005) propose and study several such architectures in which a computer can have multiple network interface cards. These architectures are modeled as a graph problem named maximum edge q-coloring...
A method for cellular manufacturing design in Group Technology is presented in this paper. The proposed method computes the dissimilarities between parts and organizes the production system in part-families and group-machines. A graph corresponding to the production system is generated and a coloring algorithm is activated in order to obtain a number of cells equal to the desired number of cell...
This lecture deals with the problem of proper vertex colorings of graphs. More speciically, we are interested in coloring a given 3-colorable graph with as few colors as we can. It is easy to see that it is NP-Hard to nd a 3 coloring for any given 3-colorable graph-this would enable deciding whether a general graph is 3-colorable. If a polynomial-time algorithm existed for 3-coloring a 3-colora...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید