Výsledky vyhľadávania - polynomial-time (dynamic OR dynamika) programming algorithms

A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses Autor Barbato, Michele, Ceselli, Alberto, Righini, Giovanni

“… In this paper, we analyze some non-trivial properties of the problem and we describe a polynomial-time dynamic programming algorithm to solve it to proven optimality…”
Získať plný text

Dynamic programming track-before-detect algorithm for radar target detection based on polynomial time series prediction Autor Zheng, Daikun, Wang, Shouyong, Meng, Qingwen

“…An improved dynamic programming track-before-detect (DP-TBD) algorithm is proposed in this study…”
Získať plný text

Policy iteration for H∞ control of polynomial time‐varying systems Autor Pakkhesal, Sajjad, Shamaghdari, Saeed

“…This paper studies the H∞ control problem for polynomial time‐varying systems. The H∞ control problem has been much less investigated for time…”
Získať plný text

Fully polynomial time (Σ,Π)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs Autor Halman, Nir, Nannicini, Giacomo

“… To circumvent these hardness results, we generalize the concept of fully polynomial-time approximation scheme allowing arbitrarily small additive and multiplicative error at the same time…”
Získať plný text

A polynomial-time exact algorithm for the sectionalizing switch allocation problem Autor Usberti, Fábio Luiz, González, José Federico Vizcaino, Assis, Laura Silva de, Cavellucci, Celso

“… In this paper, we show that it is in fact tractable by presenting the first exact polynomial-time algorithm, based on dynamic programming…”
Získať plný text

Polynomial-time algorithms for deterministic uncapacitated lot-sizing problem with heterogeneous production cycles Autor Yu, Tan, Zhong, Xiang, Guan, Yongpei

“… Incorporating multiple ordering properties into backward dynamic programming and the shortest path algorithm, we demonstrate finite value space enumeration and present an optimal algorithm with O(N4…”
Získať plný text

A polynomial-time algorithm for user-based relocation in free-floating car sharing systems Autor Schiffer, Maximilian, Hiermann, Gerhard, Rüdel, Fabian, Walther, Grit

“…•We present a polynomial algorithm for user-based relocation and vehicle dispatching…”
Získať plný text

A polynomial time algorithm to compute the connected treewidth of a series–parallel graph Autor Mescoff, Guillaume, Paul, Christophe, Thilikos, Dimitrios M.

“…It is well known that the treewidth of a graph G corresponds to the node search number where a team of searchers is pursuing a fugitive that is lazy and…”
Získať plný text

Polynomial-time equivalences and refined algorithms for longest common subsequence variants Autor Asahiro, Yuichi, Jansson, Jesper, Lin, Guohui, Miyano, Eiji, Ono, Hirotaka, Utashima, Tadatoshi

“… Recently, an exact, O(1.44225n)-time, dynamic programming (DP) based algorithm for RBLCS was proposed, where the two input sequences have lengths n and poly(n…”
Získať plný text

A Novel Polynomial-Time Algorithm for Automatic Layout of Branching Cables in a Fixed Topology Autor Xiao, Liyun, Bu, Tian-Ming, Wang, Jiangtao

“… This paper presents a polynomial-time wiring algorithm based on dynamic programming to determine branching point locations in the layout design of cables, given the electrical definition of the wire harness…”
Získať plný text

Sum‐of‐squares‐based policy iteration for suboptimal control of polynomial time‐varying systems Autor Pakkhesal, Sajjad, Shamaghdari, Saeed

“…‐based adaptive dynamic programming (ADP) algorithms in that it is developed for time‐varying systems. The convergence of the iterative algorithm and the global stability of the closed…”
Získať plný text

Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs Autor Shen, Siqian, Smith, J. Cole

“…‐time dynamic programming algorithms for solving these problems on tree structures and on series…”
Získať plný text

Polynomial-time Equational Theory for Lattices with Unary Operators Autor Van Alten, C.J.

“… Explicit algorithms are given for deciding the above equational theories. These algorithms use a dynamic programming approach and are based on a sequent calculus that extends…”
Získať plný text

A polynomial-time algorithm for Outerplanar Diameter Improvement Autor Cohen, Nathann, Gonçalves, Daniel, Kim, Eun Jung, Paul, Christophe, Sau, Ignasi, Thilikos, Dimitrios M., Weller, Mathias

“… We provide a dynamic programming algorithm that solves this problem in polynomial time. Outerplanar Diameter Improvement demonstrates several structural analogues…”
Získať plný text

A polynomial-time algorithm for sailing speed optimization with containership resource sharing Autor Wang, Shuaian, Wang, Xinchang

“…•We develop a polynomial-time algorithm to solve the problem based on bi-section search methods…”
Získať plný text

Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings Autor Rieger, Alon, Segev, Danny

“…In spite of its widespread applicability in learning theory, probability, combinatorics, and in various other fields, the Mallows model has only recently been…”
Získať plný text

A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes Autor Golin, Mordecai, Harb, Elfarouk

“…). This means that decoding a word might require a delay of a finite number of bits. Current algorithms for constructing optimal AIFV- m codes are iterative processes that construct progressively "better sets" of code trees…”
Získať plný text

A fully polynomial time approximation scheme for the probability maximizing shortest path problem Autor Lee, Jisun, Joung, Seulgi, Lee, Kyungsik

“…•A novel fully polynomial time approximation scheme (is proposed). In this paper, we consider a probability maximizing shortest path problem…”
Získať plný text

Dollo-CDP: a polynomial-time algorithm for the clade-constrained large Dollo parsimony problem Autor Dai, Junyan, Rubel, Tobias, Han, Yunheng, Molloy, Erin K.

“…The last decade of phylogenetics has seen the development of many methods that leverage constraints plus dynamic programming…”
Získať plný text

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems Autor Gu, Shenshen, Cui, Rui, Peng, Jiao

“… We first deduce the polynomial time solvable algorithms to the unconstrained binary quadratic programming problems with Q being a seven-diagonal matrix (UBQP7…”
Získať plný text