Randomization in On-line Algorithms

نویسنده

  • Octavian Procopiuc
چکیده

Motto: \\T]ime is unidirectional, past events cannot be reversed, the future is uncertain , and Murphy's Law rules" 39]

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

ثبت نام

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

منابع مشابه

Randomized Algorithms

We have already seen some uses of randomization in the design of on line algorithms In these notes we shall describe other important illustrations of randomized algo rithms in other areas of the theory of algorithms For those interested in learning more about randomized algorithms we strongly recommend the forthcoming book by Motwani and Raghavan First we shall describe some basic principles wh...

متن کامل

Randomized On-Line Scheduling of Parallel Jobs

W e study randomized on-line scheduling on mesh machines. W e show that for scheduling independent jobs randomized algorithms can achieve a signijicanily better performance than de iemin i s t i c ones; on the oiher hand with dependencies randomization does not help.

متن کامل

On Randomization in On-Line Computation

This paper concerns two fundamental but somewhat neglected issues, both related to the design and analysis of randomized on-line algorithms. Motivated by early results in game theory we define several types of randomized on-line algorithms, discuss known conditions for their equivalence, and give a natural example distinguishing between two kinds of randomizations. In particular, we show that m...

متن کامل

Estimation of LOS Rates for Target Tracking Problems using EKF and UKF Algorithms- a Comparative Study

One of the most important problem in target tracking is Line Of Sight (LOS) rate estimation for using from PN (proportional navigation) guidance law. This paper deals on estimation of position and LOS rates of target with respect to the pursuer from available noisy RF seeker and tracker measurements. Due to many important for exact estimation on tracking problems must target position and Line O...

متن کامل

Genetic and Memetic Algorithms for Sequencing a New JIT Mixed-Model Assembly Line

This paper presents a new mathematical programming model for the bi-criteria mixed-model assembly line balancing problem in a just-in-time (JIT) production system. There is a set of criteria to judge sequences of the product mix in terms of the effective utilization of the system. The primary goal of this model is to minimize the setup cost and the stoppage assembly line cost, simultaneously. B...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 1998