Results 191 to 200 of about 10,214,423 (243)

Generation of permutations in lexicographical order

BIT Numerical Mathematics, 1970
When the permutations are ordered lexicographically there is an ordering number corresponding to each permutation. A relation between the ordering numbers of complementary permutations is shown which can be useful in a computer generation of permutations.
Svein Mossige
exaly   +5 more sources

Lexicographical Order in Integer Programming

Vietnam Journal of Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martine Labbé, Alfredo Marin, Antonio M Rodríguez-Chía   +2 more
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

Exponential stabilization of inertial quaternion‐valued Cohen‐Grossberg neural networks: Lexicographical order method

International Journal of Robust and Nonlinear Control, 2020
In this article, a general class of delayed interval inertial Cohen‐Grossberg neural networks described by quaternion‐valued parameters is considered. Under the homeomorphism mapping theory and lexicographical order method, we investigate the exponential
Ruoxia Li, Jinde Cao
exaly   +2 more sources

Discovery of Approximate Lexicographical Order Dependencies

IEEE Transactions on Knowledge and Data Engineering, 2023
Lexicographical order dependencies (LODs) specify orders between list of attributes, and are proven useful in optimizing SQL queries with order by clauses.
Yifeng Jin, Zijing Tan, Jixuan Chen, Shuai Ma 0001   +3 more
openaire   +2 more sources

Exponential synchronization and state estimation of inertial quaternion‐valued Cohen‐Grossberg neural networks: Lexicographical order method

International Journal of Robust and Nonlinear Control, 2020
This paper addresses the problems of synchronization and state estimation for a class of inertial quaternion‐valued Cohen‐Grossberg neural networks.
Hongzhi Wei, Baowei Wu, Zhengwen Tu
exaly   +2 more sources

Generation of all the balanced parenthesis strings in lexicographical order

Information Processing Letters, 1981
I. Semba
exaly   +2 more sources

An efficient algorithm for generating all k-subsets (1 ⩽ k ⩽ m ⩽ n) of the set [1, 2,…, n] in lexicographical order

Journal of Algorithms, 1984
I. Semba
exaly   +2 more sources

A version numbering scheme with a useful lexicographical order

Proceedings of the Eleventh International Conference on Data Engineering, 1995
We describe a numbering scheme for versions with alternatives that has a useful lexicographical ordering. The version hierarchy is a tree. By inspection of the version numbers, we can easily determine whether one version is an ancestor of another. If so,
A. M. Keller, J. Ullman
semanticscholar   +2 more sources

Prefix- and Lexicographical-order-preserving IP Address Anonymization

2006 IEEE/IFIP Network Operations and Management Symposium NOMS 2006, 2006
Jürgen Schonwalder
exaly   +2 more sources

Lexicographical order and duality in multiobjective programming

European Journal of Operational Research, 1988
Juan Enrique Martínez-Legaz
exaly   +2 more sources