نتایج جستجو برای: packing time
تعداد نتایج: 1910383 فیلتر نتایج به سال:
We introduce methods to count and enumerate all maximal independent, all maximum independent sets, and all independent sets in threshold graphs and k-threshold graphs. Within threshold graphs and k-threshold graphs independent sets correspond to feasible solutions in related knapsack instances. We give several characterizations for knapsack instances and multidimensional knapsack instances whic...
each full weight artwork is the product of a creative idea and skillful imagination from multicultural and multicultural facts in our real world the thing inverts a scenario as a top artwork and impresses the thin kings for a long time, is the pure imaginations of a writer such that is covered by scenario writing process and methods. in terms of applying most impressiable tools such as most imp...
in a graph g = (v,e), a subset s v is said to be an open packing set if no two vertices of s have a common neighbour in g. the maximum cardinality of an open packing set is called the open packing number and is denoted by rho^o. this paper further studies on this parameter by obtaining some new bounds.
A polyomino is a polygonal region with axis-parallel edges and corners of integral coordinates, which may have holes. In this paper, we consider planar tiling packing problems pieces container P . We give polynomial-time algorithms for deciding if can be tiled k × squares any fixed part the input (that is, union set non-overlapping squares) maximum number 2 1 dominos, allowing rotations by 90°....
Many systems can be modeled with hard and various size spheres, therefore packing and geometrical structures of such sets are of great importance. In this paper, rigid spherical particles distributed in different sizes are randomly packed in confined spaces, using a parallel algorithm. Mersenne Twister algorithm was used to generate pseudorandom numbers for initial coordination of particles. Di...
Abstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...
objective: to evaluate the efficacy of modified perihepatic packing (mphp) in reducing the rate of re-bleeding rate after packing removal. methods: this was an experimental study being performed in shiraz animal laboratory. high grade liver parenchymal injury was induced in 30 transgenic australian rabbits which were then divided into two groups. group a (control) included 14 and group b (exper...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید