Add to ORKG* The work is supported by RFBR, grant 04-01-00858-a.The task of revealing the relationship between a search algorithm and a class of functions those it solves is considered. Particularly, there was found a class of functions solvable by some adaptive search algorithm for a discrete space of low cardinality. To find an optimal algorithm exhaustive search was used. Algorithm quality criterion based on equivalence classes was also introduced
Abstract. We propose a new exhaustive search algorithm for optimiza-tion in discrete graphical model...
The algorithm known as Pure Adaptive Search is a global optimisation ideal with desirable complexity...
The objective of the research project involves investigation of evolutionary computational methods, ...
We consider the problem of optimizing expensive black-box functions over discrete spaces (e.g., sets...
We show that all algorithms that search for an extremum of a cost function per-form exactly the same...
Abstract. The past twenty years has seen a rapid growth of interest in stochas-tic search algorithms...
Abstract. The past twenty years has seen a rapid growth of interest in stochas-tic search algorithms...
summary:In this paper an introduction to the theory of search, as developed in the previous papers o...
Abstract. In sequential, deterministic, non-redundant search the algorithm permutes a test function ...
The SEARCH (Search Envisioned As Relation and Class Hierarchizing) framework developed elsewhere (Ka...
Many discrete optimization problems of practical interest cannot be solved to optimality in the avai...
AbstractTest functions are commonly used to evaluate the effectiveness of different search algorithm...
Abstract. We propose a new exhaustive search algorithm for optimiza-tion in discrete graphical model...
Abstract: The article is devoted to the problem of global extremum search for several variables func...
This article is devoted to the efficiency evaluation of the local evolutional algorithms. Efficiency...
Abstract. We propose a new exhaustive search algorithm for optimiza-tion in discrete graphical model...
The algorithm known as Pure Adaptive Search is a global optimisation ideal with desirable complexity...
The objective of the research project involves investigation of evolutionary computational methods, ...
We consider the problem of optimizing expensive black-box functions over discrete spaces (e.g., sets...
We show that all algorithms that search for an extremum of a cost function per-form exactly the same...
Abstract. The past twenty years has seen a rapid growth of interest in stochas-tic search algorithms...
Abstract. The past twenty years has seen a rapid growth of interest in stochas-tic search algorithms...
summary:In this paper an introduction to the theory of search, as developed in the previous papers o...
Abstract. In sequential, deterministic, non-redundant search the algorithm permutes a test function ...
The SEARCH (Search Envisioned As Relation and Class Hierarchizing) framework developed elsewhere (Ka...
Many discrete optimization problems of practical interest cannot be solved to optimality in the avai...
AbstractTest functions are commonly used to evaluate the effectiveness of different search algorithm...
Abstract. We propose a new exhaustive search algorithm for optimiza-tion in discrete graphical model...
Abstract: The article is devoted to the problem of global extremum search for several variables func...
This article is devoted to the efficiency evaluation of the local evolutional algorithms. Efficiency...
Abstract. We propose a new exhaustive search algorithm for optimiza-tion in discrete graphical model...
The algorithm known as Pure Adaptive Search is a global optimisation ideal with desirable complexity...
The objective of the research project involves investigation of evolutionary computational methods, ...