Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “dynamic programming algorithm”

An Adaptive Dynamic Programming Algorithm

For Stochastic Multiproduct, Katerina P. Papadaki, Warren B. Powell · 2002

We address the problem of dispatching a vehicle with di#erent product classes. There is a common dispatch cost, but holding costs that vary by product class. The problem exhibits multidimensional state, outcome and action spaces, and as a result is computationally intractable using either discrete dynamic programming methods, or even as a deterministic integer program. We prove a key structural property for the decision function, and exploit this property in the development of continuous value function approximations that form the basis of an approximate dispatch rule. Comparisons on single product-class problems, where optimal solutions are available, demonstrate solutions that are within a few percent of optimal. The algorithm is then applied to a problem with 100 product classes, and comparisons against a carefully tuned myopic heuristic demonstrate significant improvements.

Cited by 0

A Dynamic Programming algorithm for

Claire Hanen, Dalila Tayachi · 2004

minimizing total cost of duplication in scheduling an outtree with communication delays and duplication

Cited by 0

Aspects of Forward Dynamic Programming Algorithm

John H. Seinfeld, Leon Lapidus · Industrial & Engineering Chemistry Process Design and Development · 1968

ADVERTISEMENT RETURN TO ISSUEPREVArticleNEXTAspects of Forward Dynamic Programming AlgorithmJ. H. Seinfeld and Leon LapidusCite this: Ind. Eng. Chem. Process Des. Dev. 1968, 7, 3, 475–478Publication Date (Print):July 1, 1968Publication History Published online1 May 2002Published inissue 1 July 1968https://pubs.acs.org/doi/10.1021/i260027a027https://doi.org/10.1021/i260027a027research-articleACS PublicationsRequest reuse permissionsArticle Views396Altmetric-Citations4LEARN ABOUT THESE METRICSArticle Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to reflect usage leading up to the last few days.Citations are the number of other articles citing this article, calculated by Crossref and updated daily. Find more information about Crossref citation counts.The Altmetric Attention Score is a quantitative measure of the attention that a research article has received online. Clicking on the donut icon will load a page at altmetric.com with additional details about the score and the social media presence for the given article. Find more information on the Altmetric Attention Score and how the score is calculated. Share Add toView InAdd Full Text with ReferenceAdd Description ExportRISCitationCitation and abstractCitation and referencesMore Options Share onFacebookTwitterWechatLinked InRedditEmail Other access options Get e-Alerts

Cited by 8

Dynamic Programming Algorithm for Interconnect Channel

Irwin, Joan Jacobs, Konstantin Moiseev Avinoam · 2009

The lithography used for 32 nanometers and smaller VLSI process technologies restricts the admissible interconnect widths and spaces to very few discrete values with some interdependencies, making traditional interconnect sizing by continuous-variable optimization techniques impossible. Single-net bottom-up power-delay optimization for discrete wire widths has been solved and got a lot of attention in literature. This article presents a dynamic programming (DP) algorithm for interconnect width and space allocation yielding the optimal power-delay tradeoff function. It sets the width and spacing of all interconnects simultaneously, thus finding the global optimum. The DP algorithm is generic and can handle a variety of power-delay objectives, such as total power or delay, or weighted sum of both, power-delay product, max delay and alike. The algorithm consistently yields more than 10 % dynamic power and 5 % delay reduction for real data blocks designed in 32 nanometer process technology. 1.

Cited by 0

Fast Dynamic Programming Based Sequence Alignment Algorithm

Nur’Aini Abdul Rashid, Rosni Abdullah, Abdullah Zawawi Talib et al. · 2006

Protein sequence alignment is basic operation mostly used in protein sequence analysis. The most optimal algorithm used in sequence alignment is based on the dynamic programming method. Smith-Waterman algorithm is the most commonly used dynamic programming based sequence alignment algorithm. However the algorithm uses quadratic time and space. Heuristic algorithm such as FASTA and BLAST were introduced to speed up the sequence alignment algorithm. FASTA is based on word search whereas BLAST is based on maximum segment pairs. In word search algorithm, lists of words from the query and database sequence are being compared to determine if two sequences have a region of sufficient similarity to merit further alignment using the Smith-Waterman Algorithm. All the different algorithms use the substitutions matrix based on the twenty alphabet amino acids. However research shows that reducing the number of amino acids to 10 does not affect the similarity measure. Our proposed algorithm uses the reduced amino acids alphabet to transform the protein sequences into a sequence of integer and uses n-gram to reduce the length of the sequence. Then the Smith-Waterman algorithm is used to get the similarity measure between two sequences. Result shows that the new proposed algorithm is as sensitive as the Smith-Waterman algorithm yet uses less space and performs better

Cited by 14

Dynamic Programming Algorithm in Accounting Information System

Peng Chen · 2024

In modern enterprise management, the role of accounting information systems is becoming increasingly important, and accurate and efficient accounting has become an important foundation for enterprise decision support. The core of this article is to apply dynamic programming algorithms to accounting information systems, optimize accounting data processing through this algorithm, and improve accounting efficiency and accuracy. This article analyzes common problems in accounting information systems, such as expense allocation, budget preparation, and cost control. To address these issues, dynamic programming algorithms were introduced and their effectiveness and superiority were verified through examples. For example, in cost allocation problems, dynamic programming algorithms can achieve reasonable allocation of expenses among departments while ensuring the minimum overall cost; In budget preparation, dynamic programming algorithms optimize budget plans based on historical data and current situations, improving the accuracy and rationality of the budget. In cost control, dynamic programming algorithms help enterprises achieve cost minimization and profit maximization by analyzing and optimizing the costs of each link. The number of accounting tasks gradually increased from the initial 10000 to 12000, 15000, 18000, and eventually reached 20000, with the amount of data processed continuously increasing. However, the average processing time has steadily decreased from 2.5 seconds to 2.1 seconds, indicating that the algorithm is still efficient in processing larger scale data and its performance continues to be optimized. This study not only enriches the application fields of dynamic programming algorithms, but also provides new ideas for optimizing accounting information systems.

Cited by 0

Video frame-matching algorithm using dynamic programming

Young-Yoon Lee · Journal of Electronic Imaging · 2009

We propose a frame-matching algorithm for video sequences, when a video sequence is modified from its original through frame removal, insertion, shuffling, and data compression. The proposed matching algorithm defines an effective matching cost function and minimizes cost using dynamic programming. Experimental results show that the proposed algorithm provides a significantly lower probability of matching errors than the conventional algorithm.

Cited by 8Open access

CELLULAR REALIZATION OF THE DYNAMIC PROGRAMMING ALGORITHM.

Robert C. Minnick, D. A. Rudberg · Defense Technical Information Center (DTIC) · 1968

General algorithmic specification, not including detailed logical design, of a highly parallel, specially organized cellular machine to embody a discrete Kalman filter is described. Various matrix operation algorithms and comparisons to sequential operations are given. Parallel computation is based on a square array of identical, limited capability modules, providing inherent speed and taking advantage of current LSI technology. The time to process increases about linearly with problem size rather than as the cube. Simulation results of a tracking problem posed by Naval Electronics Laboratory, San Diego, are included. The problem is one of a linear plant with a nonlinear observation. Thus a dynamic linearization of the observation matrix is required, such dynamics pervading the entire filter. (Author)

Cited by 0

A Dynamic Programming Algorithm for Name Matching

Philip Top, Farid Dowla, Jim Gansemer · 2007

In many database and data mining applications concerning people, name matching plays a key role. Many algorithms to match names have been proposed. These algorithms must take into account spelling and transcription errors, name abbreviations, nicknames, out of order names, and missing or extra names. The existing algorithms typically fall along the lines of sound based, edit distance based, or token based algorithms which can use other methods in matching each part of the name separately. In this article, we propose a dynamic programming approach that includes a substring matching algorithm. The algorithm's performance is compared against two often used algorithms by testing on a random sample of names from a database. The data used for the testing comes from the DHS US-VISIT Arrival and Departure Information System database, which includes names from all over the world. The performance on this data set was compared with that of the Damerau-Levenshtein algorithm and the Jaro-Winkler algorithm. The dynamic programming algorithm with substring matching performed better than both of these algorithms on the data tested

Cited by 4

A Multifeature Correspondence Algorithm Using Dynamic Programming

C. V. Jawahar , P. J. Narayanan · 2002

Correspondence between pixels is an important problem in stereo vision. Several algorithms have been proposed to carry out this task in literature. Almost all of them employ only gray-values. We show here that addition of primary or secondary evidence maps can improve the correspondence computation. However any particular combination is not guaranteed to provide proper results in a general sitiuation. What one needs is a mechanism to select the evidences which are apropriate for a particular pair of images. We present an algorithm for stereo correspondence that can take advantage of different image features adaptively for matching. A match measure combining different individual measures computed from different features is used by our algorithm. The advantages of each feature can be combined in a single correspondence computation. We describe an unsupervised scheme to compute the relevance of each feature to a particular situation, given a set of possibly useful features. We present an implementation of the scheme using dynamic programming for pixel-to-pixel correspondence.

Cited by 0

A Dynamic Programming Algorithm for Check Sorting

Frederic H. Murphy, Edward A. Stohr · Management Science · 1977

The motivation for this paper is a problem faced by banks which process large volumes of deposited checks. The checks must be separated by bank number before shipment to the Federal Reserve or other banks. The sorting is usually accomplished using a reader-sorter which reads the magnetic ink characters on the checks and separates them into different “pockets.” This paper characterizes the optimal sorting strategy and describes an efficient procedure for finding the optimal solution for problems of the size generally found in practice. The algorithm is based on a two state dynamic programming recursion in which characterization theorems are used to drastically reduce the size of the state space and in which the storage requirements are minimal. The paper includes an analysis of computational experience and describes how the algorithm can be used in a real time environment with deadlines.

Cited by 12