[PDF] Top 20 Incorporación y desarrollo del Gobierno Abierto en la gestión pública costarricense

... optimization, semidefinite programming had been in widespread ...with linear and quadratic ...to semidefinite programming ...nite programming. This paper presents a new ... See full document

... the network design preferably contains no vari- able ...the network should correspond to the exact or approximate solution ...[17]. Solving optimiza- tion problems using recurrent ... See full document

... The Hybrid modelwhich I had developed improves the accuracy of bounded variables in Linear Programming Problem model by suggesting the training and learning of parameters and constraints. The ... See full document

... Quadratic programming problem (QPP) is the problem of optimizing (minimizing or maximizing) a quadratic function of several variables subject to linear constraints on these ...quadratic programming ... See full document

... When formulating an LP model, systems analysts and researchers often include all possible constraints although some of them may not be binding at the optimal solution. The presence of redundant constraints does ... See full document

... Even though n is usually limited to three or four, the number of parameters in a back-off n-gram LM is still enormous. Assuming the vocabulary size is 64K , a 4-gram language model needs to estimate 64K 2 bigrams, ... See full document

... Roos, “Improved Full-Newton Step O(nL) Infeasible In- terior-Point Method for Linear Optimization,” Journal of Optimization Theory and Applications, Vol. 145, No. 2, 2010, pp. 271-288. ... See full document

... the recurrent language model ...joint model can only be trained on the ...n-gram model, to the target side of the parallel corpus, about 102m words for ...train recurrent models only on ... See full document

... for linear time invariant systems using now-standard methods in convex ...a semidefinite program using a semidefinite representation of a set of ...with semidefinite programming duality ... See full document

... In the entire system of the international petroleum industry, the change of petroleum price is affected by many complex factors, with an uncertain tendency and regularity. How to efficiently and accurately predict the ... See full document

... ero and 31% for Moses. The results are shown in Table 2. Interestingly the performance of slimmer translation model with fRNN-RSM exceeds baseline with full rule-table, and catches up with the orig- inal fRNN-RSM. ... See full document

... This thesis is a work that contributes to the fields of Adaptive Dynamic Programming (ADP) and Reinforcement Learning (RL). ADP is also known as Approximate Dynamic Programming. ADP and RL are together ... See full document

... The term backpropagation refers to the manner in which the gradient is computed for nonlinear multilayer networks. There are a number of variations on the basic algorithm that are based on other standard optimization ... See full document

... for solving SDPs are interior point methods ...a linear function on convex sets provided the sets are endowed with self-concordant barrier ...for solving SDPs in ... See full document

... common neural network is the feedforward mapping network, it consists of a set of nodes and a set of interconnections between ...the neural network are arranged by ... See full document

... of solving Multi objective fractional Linear programming problems in crisp case and also comparing the results are same or ...fractional programming problems are solved in which the cost ... See full document

... Linear programming is concerned with the opti- mization (minimization or maximization) of a lin- ear function while satisfying a set of linear equal- ity and/ or inequality constrains or ...of ... See full document

... This paper is organized as follows. Section 2 presents the background of the research, which includes an introduction to the problem of Solid Waste Man- agement (SWM), the concept of economies of scale in SWM, and the ... See full document

... for solving the binary linear programming model in polynomial ...binary linear programming problem is transformed into a convex quadratic programming ...quadratic ... See full document

... for solving BLPP, so that they transform the follower problem by methods such as penalty functions, barrier functions, Lagrangian relaxation method or KKT ... See full document