نتایج جستجو برای: packing time

تعداد نتایج: 1910383  

Journal: :Int. J. Found. Comput. Sci. 2010
Yong Zhang Jing-Chi Chen Francis Y. L. Chin Xin Han Hing-Fung Ting Yung H. Tsin

In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be packed into square bins of size 1×1. 90-rotation of an item is allowed. When an item arrives, we must pack it into an active bin immediately without any knowledge of the future items. The objective is to minimize the t...

Journal: :SIAM J. Comput. 1978
Edward G. Coffman M. R. Garey David S. Johnson

Processing Time first algorithm always finds a schedule having makespan within 43 1. Key words, bin packing, multiprocessor scheduling, approximation.Single capacity bin-packing algorithms were applied to solve this problem. Available system resources, the scheduling algorithm must be able to maintain a job working set. Bounds for multiprocessor scheduling with resource.We consider a natural ge...

Introduction: Controversy remains as to the advantages and disadvantages of pharyngeal packing during septorhinoplasty. Our study investigated the effect of pharyngeal packing on postoperative nausea and vomiting and sore throat following this type of surgery or septorhinoplasty.   Materials and Methods: This clinical trial was performed on 90 American Society of Anesthesiologists (ASA) I or II...

Journal: :CoRR 2016
Mark Sh. Levin

The paper described a generalized integrated glance to bin packing problems including a brief literature survey and some new problem formulations for the cases of multiset estimates of items. A new systemic viewpoint to bin packing problems is suggested: (a) basic element sets (item set, bin set, item subset assigned to bin), (b) binary relation over the sets: relation over item set as compatib...

Journal: :Math. Program. 1998
David R. Karger

Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the eeectiveness of these paradigms for two optimization problems on matroids: nding an optimum matroid basis and packing disjoint matroid bases. Applications of th...

The crystal structure of the title Schiff base complex is obtained by single-crystal X-ray diffraction data.The solid state structure determination reveals that the coordination geometry around the copper(II) center istetrahedrally distorted square-planar. The crystal packing shows one dimensional infinite chains which arisesfrom the intermolecular interaction and stabilize the crystal packing.

1998
David R. Karger

Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the eeectiveness of these paradigms for two optimization problems on matroids: nding an optimum matroid basis and packing disjoint matroid bases. Applications of th...

Journal: :Australasian J. Combinatorics 2008
Dameng Deng Renwang Su

For a given positive integer v with v ≡ 4(mod 6) and v > 4, let CKPD(v) denote a canonical Kirkman packing design of order v. It is proved in this paper that any CKPD(v) can be embedded in a CKPD(u) if u ≡ v ≡ 4 (mod 6), v ≥ 82 and u ≥ 3.5v.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید