It has often been assumed that ordering problems form a special class of problems amenable to a largely uniform treatment. Since successful ordering Genetic Algorithms (gas) have been deened for optimization of some ordering problems, it has become customary to assume that ordering problems are well solved by ordering gas tted with standardd operators. The success of the standard ordering gas o...

Ordering queries within a workload and ordering joins in a query are important problems in databases [1]. We give algorithms for the query sequencing problem that scale (small space) and are efficient (low runtime) as compared to earlier work [4]. The errors are small in practice and we are able to further reduce them using geometric repair. We provide a computational comparison of TSP solvers ...

the objective of this paper is to deal with the fuzzy conic program- ming problems. the aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. toward this end, the convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. un- der this setting, duality t...

In this paper we address the problem of reassembly of images from a collection of their fragments. The image reassembly problem is formulated as a combinatorial optimization problem and image assembly is then done by finding an optimal ordering of fragments. We present implementation results showing that images can be reconstructed with high accuracy even when there are thousands of fragments a...

In this paper, we investigate a method to decompose the search space explored by a Constraint Programming algorithm to allow a parallel solution of a Constraint Satisfaction or Optimization Problem (CSP or COP). The static tree decomposition used is based on domain partitioning according to a value ordering heuristic and a discrepancybased search strategy. This work is a parallel adaptation of ...

This paper presents a two-echelon non-repairable spare parts inventory system that consists of one warehouse and m identical retailers and implements the reorder point, order quantity (R, Q) inventory policy. We formulate the policy decision problem in order to minimize the total annual inventory investment subject to average annual ordering frequency and expected number of backorder constraint...

The compiler optimization phase ordering not only possesses challenges to compiler developer but also for multithreaded programmer to enhance the performance of Multicore systems. Many compilers have numerous optimization techniques which are applied in predetermined ordering. These ordering of optimization techniques may not always give an optimal code further it is impossible to find a unanim...