• No results found

dynamic-programming based algorithm

An Approach towards Optimizing Random Forest using Dynamic Programming Algorithm

An Approach towards Optimizing Random Forest using Dynamic Programming Algorithm

... In order to avoid huge memory requirements for storing power-set we use the algorithm based on binary counter for enumerating subsets one at a time. The subsets are evaluated simultaneously and those with ...

8

Optimal low-thrust trajectories to asteroids through an algorithm based on differential dynamic programming

Optimal low-thrust trajectories to asteroids through an algorithm based on differential dynamic programming

... Differential Dynamic Programming algorithm for the optimisation of low-thrust ...proposed algorithm is that the problem is discretised in a number of decision steps, so that the optimisation ...

54

Separator-Based Pruned Dynamic Programming for Steiner Tree

Separator-Based Pruned Dynamic Programming for Steiner Tree

... EMV algorithm and the A ∗ search as follows: instead of filling the DP table d(S, u) from small |S| to large |S|, it computes some lower bound µ(A \ S, u) of opt(A \ S, u) and processes the one with the smallest ...

8

HEURISTIC ALGORITHM FOR SINGLE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM BASED ON THE DYNAMIC PROGRAMMING

HEURISTIC ALGORITHM FOR SINGLE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM BASED ON THE DYNAMIC PROGRAMMING

... new algorithm for solving the single resource constrained project scheduling problem is ...DynamicRes algorithm for solving the multiple resource constrained project scheduling problems, and the comparison ...

18

Algorithm of Dynamic Programming for Paper Reviewer Assignment Problem

Algorithm of Dynamic Programming for Paper Reviewer Assignment Problem

... applying algorithm 5 for the original keyword set and single ...of algorithm 4: Let a paper keyword is “string matching” and a reviewer keyword is “pattern ...in algorithm 4 then edit distace is ...

5

Parameter Adjustment for a Dynamic Programming Track-before-Detect-Based Target Detection Algorithm

Parameter Adjustment for a Dynamic Programming Track-before-Detect-Based Target Detection Algorithm

... system, based on the track-before-detect (TBD) approach, is designed to track and detect dim maneuvering targets from an image sequence under low SNR conditions; a dynamic programming ...

19

A Polynomial Time Dynamic Programming Algorithm for Phrase Based Decoding with a Fixed Distortion Limit

A Polynomial Time Dynamic Programming Algorithm for Phrase Based Decoding with a Fixed Distortion Limit

... polynomial-time dynamic program- ming algorithm for phrase-based decoding with a fixed distortion ...The algorithm uses a quite dif- ferent representation of states from previous decod- ing ...

14

Dynamic Slicing of Aspect-Oriented Programs

Dynamic Slicing of Aspect-Oriented Programs

... Aspect-oriented programming (AOP) is a new programming paradigm that enables modular implementation of cross-cutting concerns such as exception handling, security, synchronization, logging ...a ...

14

Dynamic Programming Model based on Cost Minim...

Dynamic Programming Model based on Cost Minim...

... of dynamic programming is to avoid calculating the same stuff twice and usually a table of known results of subproblems is constructed for the ...purpose. Dynamic programming thus takes ...

9

Improvisation of Global Pairwise Sequence Alignment Algorithm Using Dynamic Programming

Improvisation of Global Pairwise Sequence Alignment Algorithm Using Dynamic Programming

... programing based sequence alignment becomes more complex as each base pair of the targeted sequences is compared step by step to ...side dynamic programming is complicated to apply due to the high ...

6

Advanced Dynamic Programming in Semiring and Hypergraph Frameworks

Advanced Dynamic Programming in Semiring and Hypergraph Frameworks

... algorithms based on the Inside semiring (Table 1), including the forward-backward algorithm (Baum, 1972) and Inside-Outside algorithm (Baker, 1979; Lari and Young, 1990) are widely used for unsu- ...

18

A Dynamic Programming Algorithm for Computing N gram Posteriors from Lattices

A Dynamic Programming Algorithm for Computing N gram Posteriors from Lattices

... an algorithm for com- puting the posterior probabilities of all n- grams in a lattice and constructing a mini- mal deterministic weighted finite-state au- tomaton associating each n-gram with its posterior for ...

10

Dynamic programming for parsing and estimation of stochastic unification based grammars

Dynamic programming for parsing and estimation of stochastic unification based grammars

... A parse generated by a unification grammar is a finite subset of a set F of features. Features are parse fragments, e.g., chart edges or arcs from attribute- value structures, out of which the packed representa- tions ...

8

NODES PRIORITIZATION TRAVELLING SALESMAN PROBLEM

NODES PRIORITIZATION TRAVELLING SALESMAN PROBLEM

... Optimisation algorithm will be combined with a dynamic programming in obtaining an optimal distribution and return routes based on the critical edge ...efficient algorithm for solving ...

10

An improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine

An improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine

... bound algorithm for these ...bound algorithm to minimize the makespan was developed by Dupont and Dhaenens-Flipo ...price algorithm for the same problem. They showed that their proposed ...

16

Pattern matching of signature-based IDS using Myers algorithm under MapReduce framework

Pattern matching of signature-based IDS using Myers algorithm under MapReduce framework

... a large text of length n with a short pattern p of length m allowing up to k differences, where k is a chosen thresh- old error [16]. The Myers algorithm relies on a simple dynamic programming (DP) ...

11

A Path Based Model for a Green Liner Shipping Network Design Problem

A Path Based Model for a Green Liner Shipping Network Design Problem

... the dynamic programming algorithms in reducing the state ...the dynamic programming algorithm based on data from the benchmark paper of (Løfstedt et ...

6

A Dynamic Programming Algorithm for Tree Trimming based Text Summarization

A Dynamic Programming Algorithm for Tree Trimming based Text Summarization

... Fig. 4 compares the running time of our algorithm (includes ZDD construction time) and Gurobi. Each plotted marker in the figures represents a test in- stance, and if the position of a marker is below the dashed ...

10

Fast and Unbiased Estimation of Volume Under Ordered Three-Class ROC Surface (VUS) With Continuous or Discrete Measurements

Fast and Unbiased Estimation of Volume Under Ordered Three-Class ROC Surface (VUS) With Continuous or Discrete Measurements

... efficient algorithm of linearithmic order, based on dynamic programming, for unbiased estimation of the mean and variance of VUS with unidimensional samples drawn from continuous or ...

18

Minimum Weighted Feedback Vertex Set on Diamonds

Minimum Weighted Feedback Vertex Set on Diamonds

... In this section, we propose a linear algorithm, based on dynamic programming, to solve the MWFVS problem on diamonds. In the rest of this section we consider a diamond D having r and z as its ...

5

Show all 10000 documents...

Related subjects