Results 261 to 270 of about 5,354,987 (306)
Some of the next articles are maybe not open access.
Symmetric Block Designs and Optimal Equidistant Codes
Problems of Information Transmission, 2020In this paper, it is shown that any symmetric block design with parameters \((v, k, \lambda)\) generates optimal ternary and quaternary constant-weight equidistant codes, whose parameters are uniquely determined by the parameters of the block design.
Bassalygo, L. A. +2 more
openaire +2 more sources
Numerical Functional Analysis and Optimization, 2018
We define a new interior-point method (IPM), which is suitable for solving symmetric optimization (SO) problems. The proposed algorithm is based on a new search direction. In order to obtain this direction, we apply the method of algebraically equivalent
Zsolt Darvay, P. Rigó
semanticscholar +1 more source
We define a new interior-point method (IPM), which is suitable for solving symmetric optimization (SO) problems. The proposed algorithm is based on a new search direction. In order to obtain this direction, we apply the method of algebraically equivalent
Zsolt Darvay, P. Rigó
semanticscholar +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
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
Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA
arXiv.orgWe present new advances towards achieving exponential quantum speedups for solving optimization problems by low-depth quantum algorithms. Specifically, we focus on families of combinatorial optimization problems that exhibit symmetry and contain planted ...
Ashley Montanaro, Leo Zhou
semanticscholar +1 more source
IEEE Transactions on Network Science and Engineering, 2023
Precise representation to undirected weighted network (UWN) is the foundation of understanding connection patterns inside a massive node set. It can be addressed via a Symmetric Non-negative Latent Factor (SNLF) model with a non-convex learning objective.
Weiling Li +3 more
semanticscholar +1 more source
Precise representation to undirected weighted network (UWN) is the foundation of understanding connection patterns inside a massive node set. It can be addressed via a Symmetric Non-negative Latent Factor (SNLF) model with a non-convex learning objective.
Weiling Li +3 more
semanticscholar +1 more source
H-symmetric optimal repeated measurements designs
Journal of Statistical Planning and Inference, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Optimal group symmetric localized molecular orbitals
Theoretica Chimica Acta, 1994The concept and generating method of optimum group symmetric localized molecular orbitals (OSLMOs) are proposed. The OSLMOs have strong points of orthogonality, equivalence and symmetry, and they are simultaneously as close to the classical VB structure as possible.
ZHOU, TJ, LIU, AM
openaire +2 more sources
Optimized symmetric discrete line arrays
IEEE Transactions on Antennas and Propagation, 1975A generalization of Dolph's method for the synthesis of discrete antenna arrays is applied to six different symmetric line arrays. Based on these examples, it is concluded that 1) the field patterns of optimized symmetric line arrays with the same number of elements and with the same aperture are virtually indistinguishable and 2) optimized arrays with
openaire +1 more source
The Most Likely Optimal Symmetric RVLC
IEEE Transactions on Communications, 2015For each alphabet size up to 30, a symmetric reversible variable length code (RVLC) is determined which is most likely to be optimal in average codeword length. It is shown that these codes are optimal for more than half of all the possible sources.
Sayed Jalal Zahabi +1 more
openaire +1 more source

