Results 11 to 20 of about 561,323 (357)
Discussiones Mathematicae Graph Theory, 2014 Let G be a graph that is a subgraph of some n-dimensional hypercube Qn. For sufficiently large n, Stout [20] proved that it is possible to pack vertex- disjoint copies of G in Qn so that any proportion r < 1 of the vertices of Qn are covered by the ...
Offner David
doaj +4 more sources
To Pack or Not to Pack: A Generalized Packing Analysis and Transformation
Proceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization, 2023 Artifact of the paper "To Pack or Not to Pack: A Generalized Packing Analysis and Transformation". - docker-packing-artifact.tar.gz: docker image for the execution of experiments - llvm-packing-v0.5.zip: LLVM source code with packing implementation (binary in docker image) - logs-and-graphs.zip: Log files and graphs that were used in the paper ...
Caio Salvador Rohwedder +4 more
openaire +2 more sources
Packing Graphs: The Packing Problem Solved [PDF]
The Electronic Journal of Combinatorics, 1996 For every fixed graph $H$, we determine the $H$-packing number of $K_n$, for all $n > n_0(H)$. We prove that if $h$ is the number of edges of $H$, and $gcd(H)=d$ is the greatest common divisor of the degrees of $H$, then there exists $n_0=n_0(H)$, such that for all $n > n_0$, $$ P(H,K_n)=\lfloor {{dn}\over{2h}} \lfloor {{n-1}\over{d}} \rfloor ...
Yair Caro, Raphael Yuster
openaire +3 more sources
Ant colony optimisation and local search for bin-packing and cutting stock problems [PDF]
, 2004 The Bin Packing Problem and the Cutting Stock Problem are two related classes of NP-hard combinatorial optimization problems. Exact solution methods can only be used for very small instances, so for real-world problems, we have to rely on heuristic ...
Levine, J, Ducatelle, F
core +4 more sources
Frontiers in Physics, 2021 Identical hard spheres in cylindrical confinement exhibit a rich variety of densest-packed columnar structures. Such structures, which generally vary with the corresponding cylinder-to-sphere diameter ratio D, serve as structural models for a variety of ...
Panpan Ma, Ho-Kei Chan
doaj +1 more source
Performance characteristics of a new structured packing [PDF]
, 2010 A new structured packing using carbon fibres, called Sepcarb® 4D, is presented. This packing has several attractive properties, such as high voidage (ε=94%) and high effective area (a=420 m2 m−3).
Abbé, François +13 more
core +1 more source
Starch-based Active Packaging Film and its Application
BioResources, 2023 Montmorillonite (MMT) was used to improve the performance of starch and nano-ZnO was added to act as antibacterial agent for developing a starch-based active packaging material via solution mixing and casting methods.
Xingya Kang +4 more
doaj +2 more sources
Automated packing systems - a systems engineering approach [PDF]
, 1996 The ability to manipulate previously unseen objects under visual control is one of the key tasks in the successful implementation of robotic, automated assembly and adaptive material handling systems.
Whelan, Paul F., Batchelor, Bruce G.
core +2 more sources
Hardness of approximation for orthogonal rectangle packing and covering problems [PDF]
, 2009 Bansal and Sviridenko [N. Bansal, M. Sviridenko, New approximability and inapproximability results for 2-dimensional bin packing, in: Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2004, pp.
Chlebikova, Janka +4 more
core +1 more source
Toward Wojda's conjecture on digraph packing [PDF]
Opuscula Mathematica, 2017 Given a positive integer \(m\leq n/2\), Wojda conjectured in 1985 that if \(D_1\) and \(D_2\) are digraphs of order \(n\) such that \(|A(D_1)|\leq n-m\) and \(|A(D_2)|\leq 2n-\lfloor n/m\rfloor-1\) then \(D_1\) and \(D_2\) pack.
Jerzy Konarski, Andrzej Żak
doaj +1 more source