An integer programming model

Xem 1-13 trên 13 kết quả An integer programming model
  • The selection of subjects (such as waste stream, process, apparatus, ect.) for improvement and development their alternatives when implementing cleaner production (CP) programs at the company in order to achieve the highest efficiency is a complex and timeconsuming process, especially in case when there are many subjects to be improved, and many alternatives for each subject.

    pdf13p hulk1234 01-06-2018 22 2   Download

  • The ability to compress sentences while preserving their grammaticality and most of their meaning has recently received much attention. Our work views sentence compression as an optimisation problem. We develop an integer programming formulation and infer globally optimal compressions in the face of linguistically motivated constraints. We show that such a formulation allows for relatively simple and knowledge-lean compression models that do not require parallel corpora or largescale resources. The proposed approach yields results comparable and in some cases superior to state-of-the-art.

    pdf8p hongvang_1 16-04-2013 26 1   Download

  • In particular, almost all feasible instances of the problem are solvable in O(n) time using the new algorithm, where n is the number of vertices. The developed approach also helps in fast enumeration of a neighborhood in the local search and yields an integer programming model with O(n) binary variables for the problem.

    pdf12p danhnguyentuongvi27 19-12-2018 10 0   Download

  • Department of Linguistics The University of Texas at Austin Austin, Texas 78712 or trigram Hidden Markov Model (HMM). Ravi and Knight (2009) achieved the best results thus far (92.3% word token accuracy) via a Minimum Description Length approach using an integer program (IP) that finds a minimal bigram grammar that obeys the tag dictionary constraints and covers the observed data.

    pdf9p hongdo_1 12-04-2013 35 2   Download

  • The Maximal Profit Model for reaching an optimal design of the production line undergoing the limitations of obtainable resources is presented in this paper. This model is treated as an integer programming problem, and an efficient step-by-step algorithm to solve this problem is also constructed. In addition, it is discussed that the operation cost of a machine does not include idle and breakdown situations while the maintenance cost for a broken machine should be considered.

    pdf12p vinguyentuongdanh 20-12-2018 11 0   Download

  • We present a novel computational formulation of speaker authority in discourse. This notion, which focuses on how speakers position themselves relative to each other in discourse, is first developed into a reliable coding scheme (0.71 agreement between human annotators). We also provide a computational model for automatically annotating text using this coding scheme, using supervised learning enhanced by constraints implemented with Integer Linear Programming.

    pdf9p hongdo_1 12-04-2013 34 2   Download

  • The major changes to this Fourth Edition include an earlier introduction to UML, a new section on inter-file communication in Chapter 13, and a revised approach to software development in Chapter 16. Introducing the UML at the beginning allows the use of UML diagrams where they fit naturally with topics in the text, so there are many new UML diagrams throughout the book. The section on inter-file communication gathers together many concepts that were previously scattered throughout the book.

    pdf1038p ntcong91 27-02-2013 43 9   Download

  • (bq) part 1 book "an introduction to management science - quantitative approaches to decision making" has contents: an introduction to linear programming; linear programming applications in marketing, finance, and operations management; advanced linear programming applications; distribution and network models; integer linear programming; nonlinear optimization models,...and other contents.

    pdf533p bautroibinhyen27 11-05-2017 18 3   Download

  • Dency parsing. We believe that our formulations can pave the way for efficient exploitation of global features and constraints in parsing applications, leading to more powerful models. Riedel and Clarke (2006) cast dependency parsing as an ILP, but efficient formulations remain an open problem.

    pdf9p hongphan_1 14-04-2013 26 2   Download

  • The purpose of this paper is to carry out the abelianization program proposed by Atiyah [1] and Hitchin [9] for the geometric quantization of SU(2) Wess-Zumino-Witten model. Let C be a Riemann surface of genus g. Let Mg be the moduli space of semi-stable rank 2 holomorphic vector bundles on C with trivial determinant. For a positive integer k, let Γ(Mg , Lk ) be the space of holomorphic sections of the k-th tensor product of the determinant line bundle L on Mg . An element of Γ(Mg , Lk ) is called a rank 2 theta function...

    pdf50p noel_noel 17-01-2013 42 6   Download

  • In this paper we present a joint content selection and compression model for single-document summarization. The model operates over a phrase-based representation of the source document which we obtain by merging information from PCFG parse trees and dependency graphs. Using an integer linear programming formulation, the model learns to select and combine phrases subject to length, coverage and grammar constraints.

    pdf10p hongdo_1 12-04-2013 45 1   Download

  • Many phrase alignment models operate over the combinatorial space of bijective phrase alignments. We prove that finding an optimal alignment in this space is NP-hard, while computing alignment expectations is #P-hard. On the other hand, we show that the problem of finding an optimal alignment can be cast as an integer linear program, which provides a simple, declarative approach to Viterbi inference for phrase alignment models that is empirically quite efficient.

    pdf4p hongphan_1 15-04-2013 29 1   Download

  • We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and coherent partition of coreference sets given a number of candidate pairs and their weights delivered by a pairwise classifier (used as reliable clustering seed pairs). In order to find out whether ILP optimization, which is NPcomplete, actually is the best we can do, we compared the first consistent solution generated by our adaptation of an efficient Zero-One algorithm with the optimal solution. ...

    pdf9p bunthai_1 06-05-2013 31 1   Download



p_strKeyword=An integer programming model

nocache searchPhinxDoc


Đồng bộ tài khoản