Results 131 to 140 of about 777,757 (186)
Some of the next articles are maybe not open access.
Singular Optimal Control Computation
Journal of Guidance and Control, 1978A quadratic functional version of the linear quadratic optimal control problem is employed to develop insights into the computation and theory of singular optimal controls. It is shown that sufficiency, existence, and uniqueness conditions and convergence conditions for gradient-type algorithms require the same basic assumption, namely a positivity ...
Powers, William F. +2 more
openaire +2 more sources
Toward Optimally Distributed Computation
Neural Computation, 1998This article introduces the concept of optimally distributed computation in feedforward neural networks via regularization of weight saliency. By constraining the relative importance of the parameters, computation can be distributed thinly and evenly throughout the network.
P J, Edwards, A F, Murray
openaire +2 more sources
Computation of optimal metamers
Optics Letters, 2013A fast, accurate model for computing Logvinenko's optimal metamers is introduced. The spectral reflectance of an optimal metamer is uniquely determined from a class of metamers with common tristimulus values. A set of optimal metamers is useful for evaluating the color reproduction and gamut of object colors under different illuminants. In conventional
Kenichiro, Masaoka, Roy S, Berns
openaire +2 more sources
Computer optimization of enteral hyperalimentation
Journal of Parenteral and Enteral Nutrition, 1979A computer program has been developed to allow the generation of written orders for the logical progression of enteral hyperalimentation by the technique of continuous nasogastric infusion. Data required for entry include name, age, sex, height, usual and current weights, degree of stress, and if indicated, restrictions of nitrogen, fluids, sodium and ...
R J, Geller +4 more
openaire +2 more sources
Computer Aided Design Via Optimization
IFAC Proceedings Volumes, 1979Many design problems, including control design problems, involve infinite dimensional constraints of the form @f(z, @a) @? 0 for all @a @e A, where @a denotes time or frequency or a parameter vector. In other design problems, tuning or trimming of certain parameters, after manufacture of the system, is permitted; the corresponding constraint is that ...
D.Q. Mayne +2 more
openaire +1 more source
Optimizing exact genetic linkage computations
Proceedings of the seventh annual international conference on Research in computational molecular biology, 2003Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the probability of data, which is needed for learning linkage parameters, using exact computation procedures calls for an extremely efficient implementation that carefully optimizes the order of ...
Ma'ayan, Fishelson, Dan, Geiger
openaire +2 more sources
Optimally universal parallel computers
Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1988It is shown that any program written for the idealized shared-memory model of parallel computation can be simulated on a hypercube architecture with only constant factor inefficiency, provided that the original program has a certain amount of parallel slackness.
openaire +2 more sources
Frequency Optimized Computation Methods
Journal of Scientific Computing, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources

