نتایج جستجو برای: zuhayr bin abī sūlmā

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

Journal: :Theory of Computing Systems 2008

Journal: :Journal of Applied Probability 2008

Journal: :Theoretical Computer Science 2001

Journal: :BDJ Team 2018

2009
Timothy R. Leschke

Analysis of deleted files often provides useful information for the forensic computer examiner. Knowing where to find the deleted files, and how to interpret the metadata associated with the file’s deletion, make up the cornerstone of a successful forensic computer examination. Much like an office trash-can, the Microsoft Windows Recycle Bin is a temporary holding container for files that have ...

Journal: :Theor. Comput. Sci. 2013
Yong Zhang Francis Y. L. Chin Hing-Fung Ting Xin Han Chung Keung Poon Yung H. Tsin Deshi Ye

In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items) arrive one by one, each item must be packed into a square bin of unit size on its arrival without any information about future items. When packing items, 90◦-rotation is allowed. 1-space bounded means there is only one “active” bin. If the “active” bin cannot acco...

2013
György Dósa Jirí Sgall

In the bin packing problem we are given an instance consisting of a sequence of items with sizes between 0 and 1. The objective is to pack these items into the smallest possible number of bins of unit size. FirstFit algorithm packs each item into the first bin where it fits, possibly opening a new bin if the item cannot fit into any currently open bin. In early seventies it was shown that the a...

Journal: :Hospital topics 1981
W D Cobbs

A rolling inventory count is an ongoing inventory count done throughout the year. Parts are grouped into counting sections by supplier, part number, and/ or bin locations. Each group is frequently counted throughout the year to maintain a more accurate parts inventory. The goal with a rolling inventory count is to slowly rotating through the entire inventory before completing the annual parts i...

Journal: :Discrete Applied Mathematics 2001
Guochuan Zhang

In this note we consider a new problem, the so-called bin-batching problem related to variablesized bin covering. A best possible on-line algorithm is presented. ? 2001 Elsevier Science B.V. All rights reserved.

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

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