Results 21 to 30 of about 179,193 (249)
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
Bin Packing with Multiple Colors
CoRR, 2015 In the Colored Bin Packing problem a set of items with varying weights and colors must be packed into bins of uniform weight limit such that no two items of the same color may be packed adjacently within a bin. We solve this problem for the case where there are two or more colors when the items have zero weight and when the items have unit weight.
Hamza Alsarhan +4 more
openaire +3 more sources
Compressed Subsequence Matching and Packed Tree Coloring [PDF]
Algorithmica, 2014 We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $σ$, our algorithm uses $O(n+\frac{nσ}{w})$ space and $O(n+\frac{nσ}{w}+m\log N\log w\cdot occ)$ or $O(n+\frac{nσ}{w}\log w+m\log N\cdot occ)$ time ...
Philip Bille +2 more
openaire +5 more sources
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
On The Packing k-Coloring of Unicyclic Graph Family [PDF]
, 2020 All graph in this paper is connected graph. Let du,v be a distance between any vertex u and v in graph GV,E. A function c :VG 1, 2, , k is called a packing k coloring if every two vertex of color i are at least distance i 1.
KRISTIANA, Arika Indah +2 more
core
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
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]
, 2011 Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core
FEBS Letters, EarlyView.Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +1 more source