118,661 Hits in 4.0 sec

Descriptor-in-Context Index

1972 IEEE transactions on computers  
, Optimal Iuntrctivea CoPurtitoing 9708 mryfo Transform 9731 Minimal; Minimization Interactive Computing 9708 -see also Differential Equations Minimization of Fuzzy Functions 9671 Functions  ...  Classes 9729 Simulation 9739 -see also Operating Systems, Programs -see also Stochastic Proof Sorting Proof of the Recursive Program Quicksort Proof of the Recursive Program Quicksort 0 9706  ... 
doi:10.1109/tc.1972.5009030 fatcat:2psekyc5dncjhpfifn263sdtbu

A Deterministic Dynamic Programming Approach For Optimization Problem With Quadratic Objective Function And Linear Constraints

S. Kavitha, Nirmala P. Ratchagar
2013 Zenodo  
A generalized recursive equation which gives the exact solution of an optimization problem is derived in this paper. The method is purely analytical and avoids the usage of initial solution.  ...  This paper presents the novel deterministic dynamic programming approach for solving optimization problem with quadratic objective function with linear equality and inequality constraints.  ...  The recursive optimization procedure of a dynamic programming approach provides a solution of the nstage problem by solving one stage problem and sequentially including one stage at a time and solving  ... 
doi:10.5281/zenodo.1088438 fatcat:n72kpdg6ofewtgcvm7bcbvqvva

On the computational complexity and generalization properties of multi-stage and recursive scenario programs [article]

Nikolaos Kariotoglou, Kostas Margellos, John Lygeros
2014 arXiv   pre-print
We discuss the computational complexity and feasibility properties of scenario based techniques for uncertain optimization programs.  ...  We consider different solution alternatives ranging from the standard scenario approach to recursive variants, and compare feasibility as a function of the total computation burden.  ...  Complexity optimization i , β i ∈ (0, 1)} M i=1 with M i=1 ε i ≤ ε, M i=1 β i ≤ β that minimize the total number of samples M i=1 S(ε i , β i , d i ) , is a convex optimization program of the form: min  ... 
arXiv:1412.4203v1 fatcat:nz7bruu4kjfonaguo4a2bhdqvq

Models and Algorithms for Optimal Piecewise-Linear Function Approximation

Eduardo Camponogara, Luiz Fernando Nazari
2015 Mathematical Problems in Engineering  
Derived from recursive formulations, the algorithms are applied to the approximation of the production function of gas-lifted oil wells.  ...  The models include piecewise-linear functions with a fixed and maximum number of linear segments, lower and upper envelopes, strategies to ensure continuity, and a generalization of these models for stochastic  ...  Conflict of Interests The authors declare that there is no conflict of interests regarding the publication of this paper.  ... 
doi:10.1155/2015/876862 fatcat:mg6yxlaapbcdrlm74ycgnzxuqi

On the inference of optimal descriptions

Robert Daley
1977 Theoretical Computer Science  
Indeed, the application of very general principles to a concrete problem may ther large computational effort. does provide a setting an out that we are not c On the inference of optimal descriptions 303  ...  We will regard as a universal programming system (u.P.s.) any acceptable $del numbering {Qi) (see Rogers [ls)) of the partial recursive functions for which the S -m -n function a(i, i) I which satisfies  ...  Thanks also are due to_ the referees who pointed out some deficiencies in an earlier version of this paper.  ... 
doi:10.1016/0304-3975(77)90015-9 fatcat:rau22dzqc5hfleur4a7r4gzp4m

Optimal Formation Switching with Collision Avoidance and Allowing Variable Agent Velocities [chapter]

Dalila B. M. M. Fontes, Fernando A. C. C. Fontes, Amélia C. D. Caldeira
2012 Springer Proceedings in Mathematics & Statistics  
We propose here a dynamic programming approach to solve optimally such problems.  ...  However, not all are of interest since collision avoidance is enforced. Collision avoidance is guaranteed through an appropriate choice of agent paths and agent velocities.  ...  Fig. 1 1 Dynamic Programming Recursion for an example with N = 5 and stage i = 4 . Fig. 2 2 Collision recursion.  ... 
doi:10.1007/978-1-4614-3906-6_11 fatcat:iuzuap7v2ng45f2oukpk2vd4iq

On nonlinear filters for mixed H/sup 2//H/sup /spl infin// estimation

B. Hassibi, T. Kailath
1997 Proceedings of the 1997 American Control Conference (Cat. No.97CH36041)  
We study the problem of mixed least-meansquares/H"-optimal (or mixed H2/Hm-optimal) estimation of signals generated by discrete-time, finitedimensional, linear state-space models.  ...  The major result is that, for finite-horizon problems, and when the stochastic disturbances have Gaussian distributions, the optimal solutions have finite-dimensional (i.e. , bounded-order) nonlinear state-space  ...  Thus the computational complexity of the recursive mixed H 2 / H w estimator of Theorem 3 is of the same order as that of the Kalman filter and (central) H m filters.  ... 
doi:10.1109/acc.1997.611970 fatcat:mgsyak6ejrfajiplbfq37xbvku

Finite-horizon robust Kalman filter design

Minyue Fu, C.E. de Souza, Zhi-Quan Luo
2001 IEEE Transactions on Signal Processing  
This technique involves using multiple scaling parameters that can be optimized by solving a semidefinite program. The use of optimized scaling parameters leads to an improved design.  ...  A recursive design method that can be applied to real-time applications is also proposed.  ...  Xie for his help in identifying a technical error in an earlier version of the paper.  ... 
doi:10.1109/78.942638 fatcat:64eje65tznep5mx42y2irtf63i

An efficient graph theory based method to identify every minimal reaction set in a metabolic network

Sudhakar Jonnalagadda, Rajagopalan Srinivasan
2014 BMC Systems Biology  
Graph theoretical insights offer systematic methods to not only reduce the number of variables in math programming and increase its computational efficiency, but also provide efficient ways to find multiple  ...  Results: In this paper, we propose an efficient graph theory based recursive optimization approach to identify all minimal reaction sets.  ...  Acknowledgements This work was supported by grant from Institute of Chemical and Engineering Sciences, Agency for Science, Technology and Research (A*STAR), Singapore.  ... 
doi:10.1186/1752-0509-8-28 pmid:24594118 pmcid:PMC3995987 fatcat:zjeygxl2ind4hlksaita4nlsgi

Page 946 of Mathematical Reviews Vol. 55, Issue 3 [page]

1978 Mathematical Reviews  
The author shows that many of these definitional structures are primitive recursive and that others can be expressed as an unbounded minimalization of a primitive recursive predicate.  ...  Val'kovskii (Novosibirsk) Pratt, Terrence 6928 Four models for the analysis and optimization of program contro structures.  ... 

Page 1331 of Mathematical Reviews Vol. , Issue 86c [page]

1986 Mathematical Reviews  
We strengthen this theorem and show that any lexicomaximal optimal solution to the above linear program (under any arbitrary ordering of the variables) is integral and an extreme point of {z: Az > b,x  ...  The pluperfect graph theorem states that if for all integer vectors b the optimal objective value of the linear program min{e’z: Az > b, z > 0} is an integer, then those linear programs possess optimal  ... 

Page 6618 of Mathematical Reviews Vol. , Issue 2004h [page]

2004 Mathematical Reviews  
(English summary) Stochastic programming. Comput. Optim. Appl. 24 (2003), no. 2-3, 251-265.  ...  (A-WIEN-STS; Vienna) ; Halada, Ladislav (A-WIEN-STS; Vienna A note on the recursive and parallel structure of the Birge and Qi factorization for tree structured linear programs.  ... 

A dynamic programming approach to optimizing the blocking strategy for the Householder QR decomposition

Takeshi Fukaya, Yusaku Yamamoto, Shao-Liang Zhang
2008 2008 IEEE International Conference on Cluster Computing  
time Multilinear interpolation using sampled performance data.Formulation of the optimization Minimization of the estimated computation time • : a set of all the binary trees with n leaves • : an individual  ...  Optimal block width Optimal recursion level 2008/10/ 1 iWAPT2008 8 / 29 Optimization of the blocking strategy Definition of the Blocking Strategy • How to partition a matrix into blocks. • How to compute  ... 
doi:10.1109/clustr.2008.4663801 dblp:conf/cluster/FukayaYZ08 fatcat:myzvxbiuwzdcjfa3cfzcx3qfkq

Algorithms for optimal scheduling and management of hidden Markov model sensors

V. Krishnamurthy
2002 IEEE Transactions on Signal Processing  
The problem is to select an optimal measurement scheduling policy to minimize a cost function of estimation errors and measurement costs.  ...  The optimal measurement policy is solved via stochastic dynamic programming. Sensor management issues and suboptimal scheduling algorithms are also presented.  ...  Part of this work was completed at the Department of Sensors, Signals, and Systems, Royal Institute of Technology, Sweden. The author thanks Prof. B. Wahlberg for several useful technical discussions.  ... 
doi:10.1109/tsp.2002.1003062 fatcat:7qpckqprxvdnzm3o6mvy3clonu

Representative samples of programmable functions

L.K. Schubert
1974 Information and Control  
Apart from these general considerations, certain detailed relationships between representative samples and minimal programs are also developed.  ...  Specifically, there is a "sample" (finite subset) of ¢ such that every minimal program for the sample is a program for 6.  ...  Gottlieb of Johns Hopkins University for stimulating discussions on the initial part of this work, and to J. R. Sampson of the University of Alberta for his many useful comments on the manuscript.  ... 
doi:10.1016/s0019-9958(74)90777-3 fatcat:ypgstr6yobaerpggvtste3ibqi
« Previous Showing results 1 — 15 out of 118,661 results