analysis and the explanation of the document of nawader al-hekmah rejalprincipleabstractone of the traditional methods of assessment of narrations and recognition of narrators has been to correctnarrations in analogy in the primary grounds and then makesome of them exception. today, many following ibn al-walid (b. 343 ah. ) –who excludedthe narrations of a group of narratorsofnawader al-hekmaho...

Buy-It-Now (BIN) auctions, or auctions that allow bidders to buy a product at a posted price, are ubiquitous in online auction markets. In this paper, we study how bidders make their decision whether to buy a product via a regular auction or via using the BIN option. We build a model of bidder’s willingness to pay (WTP) by using boundary conditions on our WTP function; this approach imposes min...

We prove a tight lower bound on the asymptotic performance ratio ρ of the bounded space online d-hypercube bin packing problem, solving an open question raised in 2005. In the classic d-hypercube bin packing problem, we are given a sequence of d-dimensional hypercubes and we have an unlimited number of bins, each of which is a d-dimensional unit hypercube. The goal is to pack (orthogonally) the...

Demokratie lebt von Mitsprache, Präsenz und Sichtbarkeit aller Beteiligten bei besonderer Berücksichtigung der (sozial etc.) Benachteiligten. Wer möchte, dass bestimmte Anliegen wahrgenommen werden, muss auf sie aufmerksam machen (pro-)aktiv vertreten, begründen, nicht selten verteidigen beharrlich einfordern. Immer wieder werden zu ihrer Durchsetzung polarisierende Mittel eingsetzt, um dem Das...

The bin packing game is a cooperative N -person game, where the set of players consists of k bins, each has capacity 1 and n items of sizes a1, a2, ⋅ ⋅ ⋅ , an, w.l.o.g, we assume 0 ≤ ai ≤ 1 for all 1 ≤ i ≤ n. The value function of a coalition of bins and items is the maximum total size of items in the coalition that can be packed into the bins of the coalition. A typical question of the bin pac...

The bin-packing problem is to partition a multiset of n numbers into as few bins of capacity C as possible, such that the sum of the numbers in each bin does not exceed C. We compare two existing algorithms for solving this problem: bin completion (BC) and branch-and-cut-and-price (BCP). We show experimentally that the problem difficulty and dominant algorithm are a function of n, the precision...