• No results found

linear-time dynamic programming based algorithm

A Dynamic Programming Algorithm for Tree Trimming based Text Summarization

A Dynamic Programming Algorithm for Tree Trimming based Text Summarization

... integer linear programming (ILP) solvers to obtain exact ...a dynamic programming (DP) algo- rithm for tree trimming problems whose run- ning time is O(NL log N), where N is the number ...

10

Dynamic Programming for Linear Time Incremental Parsing

Dynamic Programming for Linear Time Incremental Parsing

... to dynamic programming. We show that, surprisingly, dynamic programming is in fact possible for many shift-reduce parsers, by merging “equivalent” stacks based on feature ...our ...

10

Minimum Weighted Feedback Vertex Set on Diamonds

Minimum Weighted Feedback Vertex Set on Diamonds

... ear time algorithm to solve MWFVS on ...our linear algorithm based on dynamic programming to optimally solve MWFVS on ...

5

Performance evaluation of scheduling policies for the DRCMPSP

Performance evaluation of scheduling policies for the DRCMPSP

... the dynamic resource-constrained multi-project scheduling problem where projects generate rewards at their completion, completions later than a due date cause tardiness costs and new projects arrive randomly ...

15

Service Networks Topological Design

Service Networks Topological Design

... Partitioning algorithm (BPA) is a core sub-algorithm for solutions of many problems dealing with configuration/topological design of networks and other clustering ...

5

The Kth-best approach for linear bilevel multifollower programming with partial shared variables among followers

The Kth-best approach for linear bilevel multifollower programming with partial shared variables among followers

... Abstract - In a real world bilevel decision-making, the lower level of a bilevel decision usually involves multiple decision units. This paper proposes the Kth-best approach for linear bilevel multifollower ...

27

Determining Efficient Solutions of Multi Objective Linear Fractional Programming Problems and Application

Determining Efficient Solutions of Multi Objective Linear Fractional Programming Problems and Application

... In this paper, a modified method to find the efficient solutions of mul- ti-objective linear fractional programming (MOLFP) problems is presented. While some of the previously proposed methods provide only ...

12

An integrated heuristic method based on piecewise regression and cluster analysis for fluctuation data (A case study on health-care: Psoriasis patients)

An integrated heuristic method based on piecewise regression and cluster analysis for fluctuation data (A case study on health-care: Psoriasis patients)

... regression based on Lerman and Hadson ...model based on integer linear programming and a heuristic algorithm to estimate the number and location of break points in piecewise ...as ...

15

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

... VUS based on discrete measure- ments are still scarcely considered in the statistical ...former algorithm is biased and time-consuming, while the latter combined with any existing algorithms ...

18

Some contributions to the theory of mathematical programming

Some contributions to the theory of mathematical programming

... The Multiplex Method, though reported in the literature [30, 16,69,74,29,32.], is not so well known and has also not been widely coded on electronic computers. It had earlier been programmed fox the English Electric’s ...

129

Modeling of Gauss elimination technique for multi-objective linear programming problem

Modeling of Gauss elimination technique for multi-objective linear programming problem

... as linear polynomial and corresponding optimization problems are multi-objective programs of linear ...multi-objective linear programming problem by using concept of ...

5

A Modified Centered Climbing Algorithm for Linear Programming

A Modified Centered Climbing Algorithm for Linear Programming

... ladder algorithm called “the Modified Centered Climbing Algo- rithm (MCCA)”, where a specific climbing rule is em- ployed by means of the centered vector used by CCA ...ladder algorithm has surprising ...

7

Lecture 00 Array Stack Queue

Lecture 00 Array Stack Queue

... Edit distance: summary Matrix-filling dynamic programming algorithm is Omn time and space FillIng matrix is Omn space and time, and yields edit distance Backtrace is Om + n time, yields [r] ...

30

Medium-Term Hydropower Scheduling with Variable Head under Inflow, Energy and Reserve Capacity Price Uncertainty

Medium-Term Hydropower Scheduling with Variable Head under Inflow, Energy and Reserve Capacity Price Uncertainty

... an algorithm based on stochastic dual dynamic programming (SDDP) to solve the nonconvex MTHS problem, and show that the use of Strengthened Benders (SB) cuts to represent the expected future ...

15

Absolute Change Pivot Rule for the Simplex Algorithm

Absolute Change Pivot Rule for the Simplex Algorithm

... proposed algorithm could reduce the number of such iteration over the Dantzig’s pivot ...simplex algorithm using the absolute change pivot rule is very fast for solving linear programming ...

5

A Non linear Programming Model for the Machine Grouping and a Genetic Algorithm based Solution Methodology

A Non linear Programming Model for the Machine Grouping and a Genetic Algorithm based Solution Methodology

... mathematical programming approaches are very much suitable for getting good ...researchers based on mathematical programming and the main advantage of mathematical models is the easiness of ...

5

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 Liner Shipping Network Design Problem (LSNDP) aims to optimize the design of the networks to minimize cost, while satisfying customer service requirements and operational constraints. The mathematical formulation of ...

6

A New Gibbs-Sampling Based Algorithm for Bayesian Model Updating of Linear Dynamic Systems with Incomplete Complex Modal Data

A New Gibbs-Sampling Based Algorithm for Bayesian Model Updating of Linear Dynamic Systems with Incomplete Complex Modal Data

... vibration based modal identification techniques available [1-7] that provide optimal estimates of the modal ...models, based on the experimental modal ...sampler based simulation approach for model ...

5

GENETIC ALGORITHM: APPLICATIONS TO LINEAR AND INTEGER PROGRAMMING PROBLEMS

GENETIC ALGORITHM: APPLICATIONS TO LINEAR AND INTEGER PROGRAMMING PROBLEMS

... Step 1: We must first code the decision variables of as some finite- length string first to use genetic algorithm. The variable x is coded as a binary unsigned integer of length 5. As with a five-bit (binary ...

11

Prevention of Voltage Instability by Using FACTS Controllers in Power Systems: A Literature Survey

Prevention of Voltage Instability by Using FACTS Controllers in Power Systems: A Literature Survey

... system dynamic performance ...immune-based algorithm has been addressed for optimal coordination of local physically based controllers in order to presence or retain mid and long term voltage ...

13

Show all 10000 documents...

Related subjects