Browsing by Keywords "Polynomial approximation"

Now showing items 1-9 of 9

    • Batch scheduling to minimize the weighted number of tardy jobs 

      Erel, E.; Ghosh, J. B. (Pergamon Press, 2007)
      In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation ...

    • Double bound method for solving the p-center location problem 

      Calik, H.; Tansel, B. C. (Elsevier, 2013)
      We give a review of existing methods for solving the absolute and vertex restricted p-center problems on networks and propose a new integer programming formulation, a tightened version of this formulation and a new method ...

    • FPTAS for half-products minimization with scheduling applications 

      Erel, E.; Ghosh, J. B. (Elsevier, 2008)
      A special class of quadratic pseudo-boolean functions called "half-products" (HP) has recently been introduced. It has been shown that HP minimization, while NP-hard, admits a fully polynomial time approximation scheme ...

    • Joint mixability of some integer matrices 

      Bellini, F.; Karaşan, O. E.; Pınar, M. Ç. (Elsevier B.V.Elsevier BV, 2016)
      We study the problem of permuting each column of a given matrix to achieve minimum maximal row sum or maximum minimal row sum, a problem of interest in probability theory and quantitative finance where quantiles of a random ...

    • Minimizing weighted mean absolute deviation of job completion times from their weighted mean 

      Erel, E.; Ghosh, J. B. (Elsevier, 2011)
      We address a single-machine scheduling problem where the objective is to minimize the weighted mean absolute deviation of job completion times from their weighted mean. This problem and its precursors aim to achieve the ...

    • Minimum maximum-degree publish-subscribe overlay network design 

      Onus, Melih; Richa, A.W. (IEEE, 2011)
      Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scalability and efficiency, it is important to ...

    • Network-aware virtual machine placement in cloud data centers with multiple traffic-intensive components 

      Ilkhechi, A. R.; Korpeoglu, I.; Ulusoy, Özgür (Elsevier BV, 2015)
      Following a shift from computing as a purchasable product to computing as a deliverable service to consumers over the Internet, cloud computing has emerged as a novel paradigm with an unprecedented success in turning utility ...

    • Noise-enhanced M-ary hypothesis-testing in the minimax framework 

      Bayram, Suat; Gezici, Sinan (IEEE, 2009-09)
      In this study, the effects of adding independent noise to observations of a suboptimal detector are studied for M-ary hypothesis-testing problems according to the minimax criterion. It is shown that the optimal additional ...

    • One-dimensional partitioning for heterogeneous systems: theory and practice 

      Pınar, A.; Tabak, E. K.; Aykanat, Cevdet (Academic Press, 2008-11)
      We study the problem of one-dimensional partitioning of nonuniform workload arrays, with optimal load balancing for heterogeneous systems. We look at two cases: chain-on-chain partitioning, where the order of the processors ...