Programming Research Group A NOTE ON PROBABILISTIC INTEGER SORTING
نویسندگان
چکیده
We present a new probabilistic sequential algorithm for stable sorting n uniformly distributed keys in an arbitrary range. The algorithm runs in linear time with very-high probability 1 ? 2 ?(n) (the best previously known probability bound has been 1 ? 2 ?(n=(lg n lg lg n))). We also describe an EREW PRAM version of the algorithm that sorts in O((n=p + lg p) lg n= lg (n=p + lg n)) time using p n processors within the same probability bound. Additionally, we present experimental results for the sequential algorithm that establish the practicality of our algorithm.
منابع مشابه
Programming Research Group PRIMITIVE OPERATIONS ON THE BSP MODEL
The design of a complex algorithm relies heavily on a set of primitive operations and the instruments required to compile these operations into an algorithm. In this work, we examine some of these basic primitive operations and present algorithms that are suitable for the Bulk-Synchronous Parallel model. In particular, we consider algorithms for the following primitive operations: broadcasting,...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملOn mixed integer reformulations of monotonic probabilistic programming problems with discrete distributions
The paper studies large scale mixed integer reformulation approach to stochastic programming problems containing probability and quantile functions, under assumption of discreteness of the probability distribution involved. Jointly with general sample approximation technique and contemporary mixed integer programming solvers the approach gives a regular framework to solution of practical probab...
متن کاملEliciting Electre Tri category limits for a group of decision makers
Multiple criteria sorting aims at assigning alternatives evaluated on several criteria to predefined ordered categories. In this paper, we consider a well known multiple criteria sorting method, Electre Tri, which involves three types of preference parameters: (1) category limits defining the frontiers between consecutive categories, (2) weights and majority level specifying which coalitions fo...
متن کاملA Multi-Objective Fuzzy Approach to Closed-Loop Supply Chain Network Design with Regard to Dynamic Pricing
During the last decade, reverse logistics networks received a considerable attention due to economic importance and environmental regulations and customer awareness. Integration of leading and reverse logistics networks during logistical network design is one of the most important factors in supply chain. In this research, an Integer Linear Programming model is presented to design a multi-layer...
متن کامل