Results 261 to 270 of about 2,351,118 (294)
Some of the next articles are maybe not open access.
On a Class of Symmetric Optimization Problems
Cybernetics and Systems Analysis, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Optimization of the Synthesis of Symmetric Aromatic Tri- and Tetrasulfides
The Journal of Organic Chemistry, 2003AbstractFor Abstract see ChemInform Abstract in Full Text.
Eli, Zysman-Colman, David N, Harpp
openaire +2 more sources
Optimal trajectories for symmetric turns
American Journal of Physics, 2023The problem of determining minimal time trajectories in a plane constrained by an upper bound on the magnitude of the acceleration vector is reexamined. In the previous work [Am. J. Phys. 49(7), 685–688 (1981)], a stationary solution of a functional, applied over curves in two-dimensional velocity space, was used to find explicit expressions for what ...
openaire +1 more source
Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
SIAM Journal on Matrix Analysis and Applications, 1995Let A denote an $n \times n$ real symmetric matrix-valued function depending on a vector of real parameters, $x \in \Re ^m $. Assume that A is a twice continuously differentiable function of x, with the second derivative satisfying a Lipschitz condition. Consider the following optimization problem: minimize the largest eigenvalue of $A(x)$. Let $x^ * $
Michael L. Overton, Robert S. Womersley
openaire +2 more sources
An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices
SIAM Journal on Computing, 1980A fundamental problem in the computer solution of a sparse, N by N, positive definite system of equations $Ax = b$ is, given the structure of A, to determine the structure of its Cholesky factor L, where $A = LL^T $. This problem arises because it is often desirable to set up a data structure for L before the numerical computation is performed, and in ...
Alan George, Joseph W. H. Liu
openaire +2 more sources
Depth Optimized Synthesis of Symmetric Boolean Functions
2021 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), 2021Symmetric Boolean functions are characterized by the fact that their output can be determined by the Hamming weight of their inputs. Symmetric Boolean functions are essential for many complex systems and possess significant cryptographic properties.Due to their popularity and significance, research has been focusing on optimization of synthesis ...
Martha Schnieber +2 more
openaire +2 more sources
Optimal circularly symmetric quantizers
Journal of the Franklin Institute, 1982Abstract Polar coordinates quantization of the bivariate Gaussian and other cir- cularly symmetric sources has already been investigated. The schemes quantize the polar coordinates representation of the random variables independently in an attempt to reduce the mean square error below that of an analogous rectangular coordinates quantizer.
Peter F. Swaszek, John B. Thomas
openaire +1 more source
Optimal Symmetric Ternary Quantum Encryption Schemes
International Journal of Theoretical Physics, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Yu-qi +3 more
openaire +1 more source
Delay optimal coteries on regular symmetric networks
Computer Standards & Interfaces, 2001Abstract Coteries, introduced by Garcia-Molina and Barbara [Journal for the Association for Computing Machinery, 32 (4) (1985) 841], are an important and effective tool for enforcing mutual exclusion in distributed systems. Communication delay is an important performance measure for a coterie. Fu et al.
Prem Chandra Saxena +2 more
openaire +2 more sources
Ant colony optimization for symmetrical FPGA placement
2009 11th IEEE International Conference on Computer-Aided Design and Computer Graphics, 2009Field programmable gate arrays (FPGAs) are becoming increasingly important implementation platforms for digital circuits. This paper presents a method for symmetrical FPGA placement based on ant colony optimazation (ACO). Also, we take the routing congestion into consideration by introducing a congestion factor in our algorithm.
Kai Wang, Ning Xu
openaire +2 more sources