Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
3.5
2.4
Journals
Mathematics
Special Issues
Dynamic Programming
share announcement

Dynamic Programming

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Mathematics and Computer Science".

Deadline for manuscript submissions: 31 March 2025 | Viewed by 1926

Special Issue Editor

Dr. Abdullah N. Arslan

E-Mail Website
Guest Editor
Department of Computer Science, Texas A&M University-Commerce, Commerce, TX 75428, USA
Interests: dynamic programming; fractional programming; graph algorithms; string algorithms

Special Issue Information

Dear Colleagues,

Dynamic programming is an algorithm design technique suitable for solving certain optimization problems. A major characteristic of a dynamic programming solution is that sub-problems are solved in an order of increasing problem size, by which solving the next sub-problem makes use of recorded solutions of sub-problems encountered earlier. This avoids solving the same sub-problems repeatedly. Dynamic programming yields efficient algorithms for many optimization problems on graphs (e.g., all-pairs shortest paths), and patterns (e.g., edit distance, sequence alignment). Dynamic-programming-based algorithms have applications in a wide array of research areas, including computational biology, computational finance, computational economics, computational intelligence, machine learning, artificial intelligence, operations research, business analytics, data analysis, and machine learning. This Special Issue on dynamic programming aims to bring together articles that present novel ideas and new solutions that use dynamic programming for computational problems. Reviews that provide new focus or new perspectives for dynamic programming algorithms and applications are also welcome.

Dr. Abdullah N. Arslan
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • algorithm
  • optimization
  • computational problem
  • mathematical programming
  • bottom-up approach
  • iterative method
  • table lookup

Published Papers (1 paper)

Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

28 pages, 3084 KiB  
Article
Polynomial-Time Constrained Message Passing for Exact MAP Inference on Discrete Models with Global Dependencies
by Alexander Bauer, Shinichi Nakajima and Klaus-Robert Müller
Mathematics 2023, 11(12), 2628; https://doi.org/10.3390/math11122628 - 08 Jun 2023
Viewed by 913
Abstract
Considering the worst-case scenario, the junction-tree algorithm remains the most general solution for exact MAP inference with polynomial run-time guarantees. Unfortunately, its main tractability assumption requires the treewidth of a corresponding MRF to be bounded, strongly limiting the range of admissible applications. In [...] Read more.
Considering the worst-case scenario, the junction-tree algorithm remains the most general solution for exact MAP inference with polynomial run-time guarantees. Unfortunately, its main tractability assumption requires the treewidth of a corresponding MRF to be bounded, strongly limiting the range of admissible applications. In fact, many practical problems in the area of structured prediction require modeling global dependencies by either directly introducing global factors or enforcing global constraints on the prediction variables. However, this always results in a fully-connected graph, making exact inferences by means of this algorithm intractable. Previous works focusing on the problem of loss-augmented inference have demonstrated how efficient inference can be performed on models with specific global factors representing non-decomposable loss functions within the training regime of SSVMs. Making the observation that the same fundamental idea can be applied to solve a broader class of computational problems, in this paper, we adjust the framework for an efficient exact inference to allow much finer interactions between the energy of the core model and the sufficient statistics of the global terms. As a result, we greatly increase the range of admissible applications and strongly improve upon the theoretical guarantees of computational efficiency. We illustrate the applicability of our method in several use cases, including one that is not covered by the previous problem formulation. Furthermore, we propose a new graph transformation technique via node cloning, which ensures a polynomial run-time for solving our target problem. In particular, the overall computational complexity of our constrained message-passing algorithm depends only on form-independent quantities such as the treewidth of a corresponding graph (without global connections) and image size of the sufficient statistics of the global terms. Full article
(This article belongs to the Special Issue Dynamic Programming)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-1
Back to TopTop