A computationally efficient procedure for multiobjective design optimization with variable-fidelity models and response surface surrogates is presented. The proposed approach uses the multiobjective evolutionary algorithm that works with a fast surrogate model, obtained with kriging interpolation of the low-fidelity model data enhanced by space-mapping correction exploiting a few high-fidelity training points. The initial Pareto...

Praca pokazuje ważność pytań z zakresu etyki, stawianych wszelkiej przedsię-biorczości, działalności ekonomicznej w ujęciu historycznym. Jednocześniepraca usiłuje znaleźć przyczynę roztraygnięć etycznych współczesności.

We consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T\{v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total...

We present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.

We present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.