Results 11 to 20 of about 310,664 (317)
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 +3 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 +2 more sources
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
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 +1 more source
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
Extreme-Point-based Heuristics for the Three-Dimensional Bin Packing problem [PDF]
, 2008 One of the main issues in addressing three-dimensional packing problems is finding an efficient and accurate definition of the points at which to place the items inside the bins, because the performance of exact and heuristic solution methods is actually
CRAINIC T. G +3 more
core +1 more source
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brett Stevens, Eric Mendelsohn
openaire +1 more source
C-clamp and pelvic packing for control of hemorrhage in patients with pelvic ring disruption [PDF]
, 2011 BACKGROUND: Exsanguinating hemorrhage is the major cause of death in patients with pelvic ring disruption. AIMS: The aim of this study was to document outcomes after the stabilization of pelvic ring injuries by a C-clamp and control of hemorrhage ...
Meier, C +11 more
core +1 more source
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Flávio Keidi Miyazawa +1 more
openaire +1 more source