Dynamic programming

Xem 1-20 trên 447 kết quả Dynamic programming
  • We develop a general dynamic programming technique for the tabulation of transition-based dependency parsers, and apply it to obtain novel, polynomial-time algorithms for parsing with the arc-standard and arc-eager models. We also show how to reverse our technique to obtain new transition-based dependency parsers from existing tabular methods. Additionally, we provide a detailed discussion of the conditions under which the feature models commonly used in transition-based parsing can be integrated into our algorithms. ...

    pdf10p hongdo_1 12-04-2013 33 5   Download

  • There exist several methods of calculating a similarity curve, or a sequence of similarity values, representing the lexical cohesion of successive text constituents, e.g., paragraphs. Methods for deciding the locations of fragment boundaries are, however, scarce. We propose a fragmentation method based on dynamic programming. The method is theoretically sound and guaranteed to provide an optimal splitting on the basis of a similarity curve, a preferred fragment length, and a cost function defined. ...

    pdf3p bunrieu_1 18-04-2013 26 3   Download

  • Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a tiny fraction of the whole space (even with beam search) as opposed to dynamic programming.

    pdf10p hongdo_1 12-04-2013 18 2   Download

  • Lecture Algorithm design - Chapter 6: Dynamic programming II include all of the following: Sequence alignment, hirschberg's algorithm, Bellman-Ford algorithm, distance vector protocols, negative cycles in a digraph.

    pdf50p youcanletgo_03 14-01-2016 15 2   Download

  • We present the first version of a new declarative programming language. Dyna has many uses but was designed especially for rapid development of new statistical NLP systems. A Dyna program is a small set of equations, resembling Prolog inference rules, that specify the abstract structure of a dynamic programming algorithm. It compiles into efficient, portable, C++ classes that can be easily invoked from a larger application.

    pdf4p bunbo_1 17-04-2013 19 1   Download

  • Stochastic unification-based grammars (SUBGs) define exponential distributions over the parses generated by a unificationbased grammar (UBG). Existing algorithms for parsing and estimation require the enumeration of all of the parses of a string in order to determine the most likely one, or in order to calculate the statistics needed to estimate a grammar from a training corpus.

    pdf8p bunmoc_1 20-04-2013 17 1   Download

  • In this paper we introduce a dynamic programming algorithm to perform linear text segmentation by global minimization of a segmentation cost function which consists of: (a) within-segment word similarity and (b) prior information about segment length. The evaluation of the segmentation accuracy of the algorithm on Choi's text collection showed that the algorithm achieves the best segmentation accuracy so far reported in the literature. Keywords: Text Segmentation, Document Retrieval, Information Retrieval, Machine Learning. ...

    pdf8p bunthai_1 06-05-2013 22 1   Download

  • We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-local features that violate the classical structural independence assumptions. It is inspired by cube pruning (Chiang, 2007; Huang and Chiang, 2007) in its computation of non-local features dynamically using scored k-best lists, but also maintains additional residual quantities used in calculating approximate marginals. ...

    pdf9p bunthai_1 06-05-2013 19 1   Download

  • Lecture Algorithm design - Chapter 6: Dynamic programming I include all of the following: Weighted interval scheduling, segmented least squares, knapsack problem, RNA secondary structure.

    pdf37p youcanletgo_03 14-01-2016 15 1   Download

  • In this paper we simultaneously address four constraints relevant to airline revenue management problem: Flight cancellation, customer no-shows, overbooking and refunding. We develop a linear program closely related to the dynamic program formulation of the problem which we later use to approximate the optimal decision rule for rejecting or accepting customers. We give a novel proof that the optimal objective function of this linear program is always an upper bound for the dynamic program.

    pdf20p danhnguyentuongvi27 19-12-2018 1 0   Download

  • We introduce a heuristic method for the single resource constrained project scheduling problem, based on the dynamic programming solution of the knapsack problem. This method schedules projects with one type of resources, in the non-preemptive case: once started an activity is not interrupted and runs to completion.

    pdf18p vinguyentuongdanh 19-12-2018 3 0   Download

  • The standard way to solve the static economic dispatch problem with transmission losses is the penalty factor method. The problem is solved iteratively by a Lagrange multiplier method or by dynamic programming, using values obtained at one iteration to compute penalty factors for the next until stability is attained. A new iterative method is proposed for the case where transmission losses are represented by a quadratic formula (i.e., by the traditional B-coefficients).

    pdf10p vinguyentuongdanh 20-12-2018 6 0   Download

  • This paper addresses an optimal cooperative tracking control method with disturbance rejection in the presence of no knowledge of internal dynamics for multi-nonholonomic mobile robot (NMR) systems. Unlike most existing methods, our method integrates kinematic and dynamic controllers into one using adaptive dynamic programming techniques based on the concept of differential game theory and neural networks, and is therefore entirely optimal.

    pdf23p cumeo3000 01-08-2018 9 0   Download

  • Để giải quyết một bài toán lớn, ta chia nó thành nhiều bài toán con cùng dạng với nó để có thể giải quyết độc lập. Khi không biết cần phải giải bài những toán con nào, ta sẽ đi giải quyết tất cả các bài toán con và lưu trữ những lời giải hay đáp số của chúng với mục đích sử dụng lại theo một sự phối hợp nào đó để giải quyết những bài toán tổng quát hơn

    ppt15p taikhoankhongthedung 21-11-2012 160 54   Download

  • The popular C# programming language combines the high productivity of rapid application development languages with the raw power of C and C++. Updated to cover the new features of C# 4.0, including dynamic binding, named and optional parameters, and covariant and contravariant generic types, this release takes the language to the next level by adding the ability to cleanly write programs that don't rely on static type definitions. This allows dynamic programming languages such as Python, Ruby, and JavaScript to feel native to C#.

    pdf862p hoa_can 28-01-2013 57 24   Download

  • This book is about a marriage of two compatible yet unlikely partners. Extreme Programming (XP) is a software development methodology that enables users, business people, programmers, and computers to communicate effectively. Perl is a dynamic programming language that lets an XP team embrace the inevitable change caused by effective communication. Perl the fixer and doer of the pair, and XP is the organizer and facilitator. Together they help you build robust software applications efficiently. Like any good marriage, the partners of Extreme Perl support each other....

    pdf194p tailieuvip13 20-07-2012 41 7   Download

  • Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Solvability and Algorithms for Functional Equations Originating from Dynamic Programming

    pdf30p sting05 09-02-2012 22 6   Download

  • Programming Contest is a delightful playground for the exploration of intelligence of programmers. To start solving problems in contests, first of all, you have to fix your aim. Some contestants want to increase the number of problems solved by them and the other contestants want to solve less problems but with more efficiency. Choose any of the two categories and then start. A contestant without any aim can never prosper in 24 hours online judge contests. So, think about your aim.[

    pdf121p tailieuvip13 20-07-2012 37 5   Download

  • Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article On Properties of Solutions for Two Functional Equations Arising in Dynamic Programming

    pdf19p sting06 13-02-2012 28 4   Download

  • Dưới đây là bài giảng Phân tích thiết kế giải thuật: Chương 1 - Dynamic Programming. Bài giảng bao gồm những nội dung về nguyên tắc của Dynamic Programming; các yếu tố để áp dụng Dynamic Programming; một biến dạng của Dynamic Programming.

    ppt41p cocacola_09 26-11-2015 34 4   Download

CHỦ ĐỀ BẠN MUỐN TÌM

Đồng bộ tài khoản