Collecting Weighted Items from a Dynamic Queue

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue

The bounded-delay packet scheduling (or buffer management) problem is to schedule transmissions of packets arriving in a buffer of a network link. Each packet has a deadline and a weight associated with it. The objective is to maximize the weight of packets that are transmitted before their deadlines, assuming that only one packet can be transmitted in one time step. Online packet scheduling al...

متن کامل

Mining Association Rules with Weighted Items

Discovery of association rules has been found useful in many applications. In previous work, all items in a basket database are treated uniformly. We generalize this to the case where items are given weights to re ect their importance to the user. The weights may correspond to special promotions on some products, or the pro tability of di erent items. We can mine the weighted association rules ...

متن کامل

Repair systems with exchangeable items and the longest queue mechanism

We consider a repair facility consisting of one repairman and two arrival streams of failed items, from bases 1 and 2. The arrival processes are independent Poisson processes, and the repair times are independent and identically exponentially distributed. The item types are exchangeable, and a failed item from base 1 could just as well be returned to base 2, and vice versa. The rule according t...

متن کامل

Tandem queue weighted fair smooth scheduling

Network devices supporting 100G links are in demand to meet the communication requirements of computing nodes in datacenters and warehouse computers. In this paper, we propose TQ and TQ-Smooth, two lightweight, fair schedulers that accommodate an arbitrarily large number of requestors and are suitable for ultrahigh-speed links. We show that our first algorithm, TQ, as well its predecessor, DRR,...

متن کامل

Inferring Quality from a Queue

In this paper, we study how rational agents infer the quality of a good (a product or a service) by observing the queue that is formed by other rational agents to obtain the good. Agents also observe privately the realization of a signal that is imperfectly correlated with the true quality of the good. Based on the queue length information and the signal realization, agents decide whether to jo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithmica

سال: 2011

ISSN: 0178-4617,1432-0541

DOI: 10.1007/s00453-011-9574-6