Existing optimization methods usually are not reliable or cannot use the nondifferentiable, not continuous objective functions or constraints. An interval global optimization method is very stable and...
Existing optimization methods usually are not reliable or cannot use the nondifferentiable, not continuous objective functions or constraints. An interval global optimization method is very stable and...
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS Re...
Abstract
In the first part of this work (see preceding paper) the theory of the method lying upon a novel concept of birefringence, azimuths, and transmission mapping in large area (up to 6 in. diame...
Abstract
In the first part of this work (see preceding paper) the theory of the method lying upon a novel concept of birefringence, azimuths, and transmission mapping in large area (up to 6 in. diame...
. We describe some results on quantization of discrete time dynamical systems ("quantum maps"). We focus our attention on a number of examples including the cat, Kronecker, and standard maps. Our main...
. We describe some results on quantization of discrete time dynamical systems ("quantum maps"). We focus our attention on a number of examples including the cat, Kronecker, and standard maps. Our main...
Given two graphs G1 and G2, the planar Ramsey number PR(G1, G2) is the smallest integer n such that every planar graph on n vertices either contains a copy of G1 or its complement contains a copy of G...