18:43 Apr 6, 2019
English to Hungarian translations [PRO]
Science - Science (general) / ládapakoló algoritmusokról szóló cikk
English term or phrase: coarseness
A "Worst-case performance bounds for simple one-dimensional packing algorithms" c. cikk 7. oldalán van ez a mondat, az egyetemista matematikusnak tanuló fiam küldte el e-mailben, hogy ez mit jelenthet; nekem az egész szöveg abszolút ókínai, de hátha tudtok a gyerekemnek segíteni. Előre is köszönöm szépen a válaszokat, Erzsi

Let us define the coarseness of a bin to be the largest a such that some bin with smaller index is filled to level 1 — a. The coarseness of the first bin is 0.
CLAIM 2.2.2. Suppose bins are filled according to either the FF or the BF algo-rithm, and some bin B has coarseness a. Then every member of B that was placed there before B was more than half full exceeds a.
Proof. Until the bin has been filled to a level greater than it must be either empty or the unique nonempty bin of lowest level (by property (i) of the placement algorithm), so by constraints (i) and (ii), any element placed in the bin must not fit in any bin with lower index, and hence must exceed a.
CLAIM 2.2.3. Let a bin of coarseness a < | be filled with numbers b., 2; b2 in the completed FF-packing (BF-packing). If Ei"=i bt > 1 — a, then
Proof. If b, > I, then the result is immediate since Wihf = 1. We therefore assume that bt |. If m 2r 2, then the second element placed in the bin was placed before the bin was more than half full, so by Claim 2.2.2, at least two of the elements exceed a. In particular, we must have bt 2: b2 2: a.

Let us define the COARSENESS of a bin to be the largest alpha s. t. some bin etc.
Erzsébet Czopyk
Local time: 06:37

Summary of answers provided
4 +1durvaság
Dora Miklody

Discussion entries: 2



2 hrs   confidence: Answerer confidence 4/5Answerer confidence 4/5 peer agreement (net): +1

statisztikai fogalom

Dora Miklody
Local time: 06:37
Meets criteria
Specializes in field
Native speaker of: Native in HungarianHungarian

Peer comments on this answer (and responses from the answerer)
agree  Tibor Pataki: a packing meg valszeg kitöltés?
10 hrs
Login to enter a peer comment (or grade)

Login or register (free and only takes a few minutes) to participate in this question.

You will also have access to many other tools and opportunities designed for those who have language-related jobs (or are passionate about them). Participation is free and the site has a strict confidentiality policy.

KudoZ™ translation help

The KudoZ network provides a framework for translators and others to assist each other with translations or explanations of terms and short phrases.

See also:

Your current localization setting


Select a language

Term search
  • All of
  • Term search
  • Jobs
  • Forums
  • Multiple search