Results 11 to 20 of about 62,783 (309)
Online bin stretching with three bins [PDF]
Journal of Scheduling, 2017 Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin.
Martin Böhm 0001 +3 more
openaire +5 more sources
Bin packing with fixed number of bins revisited [PDF]
Journal of Computer and System Sciences, 2010 AbstractAs Bin Packing is NP-hard already for k=2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the items are polynomially bounded integers, then the problem can be solved in time nO(k) for an input of length n by dynamic programming. We show, by proving the W[1]-hardness
Klaus Jansen +3 more
openaire +4 more sources
Involve, a Journal of Mathematics, 2019 13 pages, 1 figures, 1 ...
Gotshall, Daniel +4 more
openaire +3 more sources
Metagenome Proteins and Database Contamination
mSphere, 2020 Continued influx of metagenome-derived proteins with misannotated taxonomy into conventional databases, including RefSeq, threatens to eliminate the value of taxonomy identifiers.
Irina R. Arkhipova
doaj +1 more source
Binning strategy. Single binner vs multi-binning with DAS-tool
, 2022 Compare different binning strategy on mock community data (ZymoBIOMICS® Gut Microbiome Standard Catalog No. D6331). Single binner vs multi-binning with DAS-tool.
Kateryna Pantiukh (4593784)
core +1 more source
On bin packing with clustering and bin packing with delays [PDF]
Discrete Optimization, 2021 We continue the study of two recently introduced bin packing type problems, called bin packing with clustering, and online bin packing with delays. A bin packing input consists of items of sizes not larger than 1, and the goal is to partition or pack them into bins, where the total size of items of every valid bin cannot exceed 1.
openaire +4 more sources
Analysis of binning of normals for spherical harmonic cross-correlation [PDF]
, 2012 Spherical harmonic cross-correlation is a robust registration technique that uses the normals of two overlapping point clouds to bring them into coarse rotational alignment.
Michael J. Cree +5 more
core +1 more source
BinSPreader binning refining protocol
, 2023 Metagenome analysis based on high-throughput sequencing data often includes contig binning as an essential step to recover complete genomes from metagenomic data (MAGs).
Sofia Ochkalova (14514773) +1 more
core +1 more source
To Dereplicate or Not To Dereplicate?
mSphere, 2020 Metagenome-assembled genomes (MAGs) expand our understanding of microbial diversity, evolution, and ecology. Concerns have been raised on how sequencing, assembly, binning, and quality assessment tools may result in MAGs that do not reflect single ...
Jacob T. Evans, Vincent J. Denef
doaj +1 more source
Remote Sensing, 2021 A meticulous image processing workflow is oftentimes required to derive quality image data from high-resolution, unmanned aerial systems. There are many subjective decisions to be made during image processing, but the effects of those decisions on ...
Tyler Nigon +4 more
doaj +1 more source