The concepts of robust classification and intelligently controlling the search process of genetic algorithm (GA) are introduced and integrated with a conventional genetic classifier for development of a new version of it, which is called Intelligent and Robust GA-classifier (IRGA-classifier). It can efficiently approximate the decision hyperplanes in the feature space. It is shown experime...

Operation of multi-reservoir systems is known as complicated and often large-scale optimization problems. The problems, because of broad search space, nonlinear relationships, correlation of several variables, as well as problem uncertainty, are difficult requiring powerful algorithms with specific capabilities to be solved. In the present study a Self-adaptive version of Melody Search algorith...

This paper describes the application of evolution strategies to the design of interacting multiple model (IMM) tracking filters in order to fulfill a large table of performance specifications. These specifications define the desired filter performance in a thorough set of selected test scenarios, for different figures of merit and input conditions, imposing hundreds of performance goals. The de...

Extending the parameter space of the three-dimensional (d=3) Ising model, we search for a regime of eliminated corrections to finite-size scaling. For that purpose, we consider a real-space renormalization group (RSRG) with respect to a couple of clusters simulated with the transfer-matrix (TM) method. Imposing a criterion of "scale invariance," we determine a location of the nontrivial RSRG fi...

Existing paraphrase systems either create successive drafts from an underlying representation , or they aim to correct texts. A diierent kind of paraphrase, also reeecting a real-world task, involves imposing, on an original text, external constraints in terms of length, read-ability, etc. This sort of paraphrase requires a new framework which allows production of a new text satisfying the cons...

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...