-
21 data flow analysis
статистический метод предварительного исследования компилятором промежуточного кода программы, основанный на анализе описаний и использования переменных. Выполняется для последующей оптимизации генерируемого им кодаАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > data flow analysis
-
22 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
23 algorithm
4-D algorithm4-D descent advisor algorithmaiming algorithmBayesian algorithmBeam-Warming algorithmCFD algorithmCholesky algorithmcommand generation algorithmcomputational fluid dynamics algorithmcontrol algorithmdecomposition algorithmdesign algorithmdiagnosing algorithmdiagnosis algorithmdisplay algorithmengagement algorithmestimation algorithmEuler equation algorithmexplicit-implicit algorithmfeasible directions algorithmfeedback algorithmfilter algorithmfinite-volume algorithmflight management algorithmflight path algorithmflux-split algorithmFMS algorithmfrequency domain algorithmGauss-Newton algorithmgeometry generation algorithmgradient-based algorithmgrid algorithmguidance algorithmgunnery algorithmhidden surface algorithmimage-display algorithmLanczos algorithmleast-squares algorithmLevenberg-Marquardt algorithmlinear quadratic algorithmMacCormack algorithmmaneuver algorithmmaneuvering algorithmmarching algorithmmaximum likelihood estimate algorithmminimum variance algorithmmotion drive algorithmmotion-base drive algorithmmultigrid algorithmNavier-Stokes algorithmNewton-Raphson algorithmnonlinear programming algorithmoptimization algorithmplanning algorithmpole placement algorithmPotter algorithmQR algorithmrelaxation algorithmscheduling algorithmsearch algorithmshock fitting algorithmshock-capturing algorithmspeed profile algorithmspeed selection algorithmstability algorithmstate estimation algorithmsteepest descents algorithmsynthesis algorithmthrust algorithmtime-split algorithmtime-to-go algorithmtrim algorithmtwo-stage algorithm of splittingup-date algorithmupwind algorithmupwind-differenced algorithmvariable-gain algorithmweighted least squareszonal algorithm -
24 problem
1. проблема; задача2. проблема; трудностьproblem of three bodiesaerodynamic problemaeroelastic problemaeroservoelastic problembending problembest-range problembirdstrike problemBlasius boundary layer stability problemBolza problemboundary value problemBoussinesq problembuckling problemcalculus of variations problemChebyshev problemcompressible problemconstrained problemcontact problemcontinuum problemcontrol problemcorrosion problemcoupling control problemcrack problemcross-coupling problemcross-coupling robust design problemdesign problemdeterministic problemdirect problemdiscrete variable problemdivergence problemeigenvalue problemelastic contact problemelastic torsion problemelastoplastic problemelastostatic problemengine problemengine-out problemestimation problemfatigue problemfeedback problemfixed endpoint problemFlamant problemflap-lag problemflap-lag-torsion problemflight dynamics problemflutter problemg-LOC-in-flight problemg-tolerance problemguidance problemhandling problemhardware problemhigh-order problemhigh-g problemicing problemimpact problemin-service problemincompressible problemLamb's problemlanding problemlifting surface problemlinear regulator problemlinear quadratic Gaussian problemLQG problemmaneuver problemmechanics problemminimax problemminimum time problemminimum time-to-climb problemminimum fuel problemminimum time to turn problemmulti-input multi-output problemnonself-adjoint problemnonlinear inequality-constrained problemnumerical problemoptimal control problemoptimal guidance problemoptimization problemPIO problemplane stress problempost-buckling problempursuit-evasion problemrobustness problemrotor-fuselage problemrotorcraft problemsaddle point problemsafety-of-flight problemscattering problemstability problemstall problemstatically determinate problemstepped-altitude problemstress problemSturm-Liouville problemsupersonic aircraft problemsynthesis problemtail-rotor problemtakeoff problemtargeting problemthermoelasticity problemthree-state problemtime-delay-related problemtraveling salesman problemtwist problemtwo-dimensional airfoil problemtwo-point boundary value problemunconstrained problemvariational problemvibration problemviscoelastic problemvisibility problemvisual problem
- 1
- 2
См. также в других словарях:
optimization — /op teuh meuh zay sheuhn/ 1. the fact of optimizing; making the best of anything. 2. the condition of being optimized. 3. Math. a mathematical technique for finding a maximum or minimum value of a function of several variables subject to a set of … Universalium
Optimization (mathematics) — In mathematics, the term optimization, or mathematical programming, refers to the study of problems in which one seeks to minimize or maximize a real function by systematically choosing the values of real or integer variables from within an… … Wikipedia
Optimization problem — In mathematics and computer science, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two categories depending on whether the variables are continuous or… … Wikipedia
Compiler optimization — is the process of tuning the output of a compiler to minimize or maximize some attributes of an executable computer program. The most common requirement is to minimize the time taken to execute a program; a less common one is to minimize the… … Wikipedia
Cooperative optimization — is a global optimization method invented by chinese mathematician Xiao Fei Huang, that can solve real world NP hard optimization problems (up to millions of variables) with outstanding performances and unprecedented speeds. It knows whether a… … Wikipedia
Multidisciplinary design optimization — Multi disciplinary design optimization (MDO) is a field of engineering that uses optimization methods to solve design problems incorporating a number of disciplines. As defined by Prof. Carlo Poloni, MDO is the art of finding the best compromise … Wikipedia
Distributed constraint optimization — (DCOP or DisCOP) is the distributed analogue to constraint optimization. A DCOP is a problem in which a group of agents must distributedly choose values for a set of variables such that the cost of a set of constraints over the variables is… … Wikipedia
Constraint optimization — In constraint satisfaction, constrained optimization (also called constraint optimization) seeks for a solution maximizing or minimizing a cost function. Contents 1 Definition 2 Solution methods 2.1 Branch and bound … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Interprocedural optimization — (IPO) is a compiler technique used in computer programming to improve performance in programs containing many frequently used functions of small or medium length. IPO differs from other compiler optimization because it analyzes the entire… … Wikipedia
Trajectory optimization — is the process of designing a trajectory that minimizes or maximizes some measure of performance. While not exactly the same, the goal of solving a trajectory optimization problem is essentially the same as solving an optimal control problem. The … Wikipedia