Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Optymalizacja kombinatoryczna" wg kryterium: Temat


Wyświetlanie 1-5 z 5
Tytuł:
Neural networks for the N-Queens Problem : a review
Autorzy:
Mańdziuk, J.
Powiązania:
https://bibliotekanauki.pl/articles/205945.pdf
Data publikacji:
2002
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
optymalizacja kombinatoryczna
problem n-hetmanów
sieć Hopfielda
sieć neuronowa
combinatorial optimization
Hopfield network
N-Queens Problem
neural networks
Opis:
Neural networks can be successfully applied to solving certain types of combinatorial optimization problems. In this paper several neural approaches to solving constrained optimization problems are presented and their properties discussed. The main goal of the paper is to present various improvements to the wellknown Hopfield models which are intensively used in combinatorial optimization domain. These improvements include deterministic modifications (binary Hopfield model with negative self-feedback connections and Maximum Neural Network model), stochastic modifications (Gaussian Machine), chaotic Hopfield-based models (Chaotic Neural Network and Transiently Chaotic Neural Network), hybrid approaches (Dual-mode Dynamic Neural Network and Harmony Theory approach) and finally modifications motivated by digital implementation feasibility (Strictly Digital Neural Network). All these models are compared based on a commonly used benchmark prohlem - the N-Queens Problem (NQP). Numerical results indicate that each of modified Hopfield models can be effectively used to solving the NQP. Coonvergence to solutions rate of these methods is very high - usually close to 100%. Experimental time requirements are generally low - polynomial in most casos. Some discussion of non-neural, heuristic approaches to solving the NQP is also presented in the paper.
Źródło:
Control and Cybernetics; 2002, 31, 2; 217-248
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Neural network models for combinatorial optimization : a survey of deterministic, stochastic and chaotic approaches
Autorzy:
Smith, K.
Potvin, J.
Kwok, T.
Powiązania:
https://bibliotekanauki.pl/articles/205943.pdf
Data publikacji:
2002
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
chaos
odwzorowanie samoporządkujące
optymalizacja kombinatoryczna
sieć Hopfielda
sieć neuronowa
combinatorial optimization
deformable templates
Hopfield networks
neural networks
self-organizing maps
Opis:
This paper serves as a tutorial on the use of neural networks for solving combinatorial optimization problems. It reviews the two main classes of neural network models : the gradient-based neural networks such as the Hopfield network, and the deformable template approaches such as the elastic net method and self organizing maps. In each class, the original model is presented, its limitations discussed, and subsequent developments and extensions are reviewed. Particular emphasis is placed on stochastic and chaotic variations on the neural network models designed to improve the optimization performance. Finally, the performance of these neural network models is compared and discussed relative to other heuristic approaches.
Źródło:
Control and Cybernetics; 2002, 31, 2; 183-216
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Binary neural networks for N-queens problems and their VLSI implementations
Autorzy:
Funabiki, N.
Kurokawa, T.
Ohta, M.
Powiązania:
https://bibliotekanauki.pl/articles/205704.pdf
Data publikacji:
2002
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
algorytm
binarna sieć neuronowa
N-queens problem
optymalizacja kombinatoryczna
problem n-hetmanów
projekt VLSI
binary neural network
combinatorial optimization
NP-hard
VLSI design
algorithm
Opis:
Combinatorial optimization problems compose an important class of matliematical problems that include a variety of practical applications, such as VLSI design automation, communication network design and control, job scheduling, games, and genome informatics. These problems usually have a large number of variables to be solved. For example, problems for VLSI design automation require several million variables. Besides, thieir computational complexity is often intractable due to NP-hardness. Neural networks have provided elegant solutions as approximation algorithms to these hard problems due to their natural parallelism and their affinity to hardware realization. Particularly, binary neural networks have great potential to conform to current digital VLSI design technology, because any state and parameter in binary neural networks are expressed in a discrete fashion. This paper presents our studies on binary neural networks to the N-queens problem, and the three different approaches to VLSI implementations focusing on the efficient realization of the synaptic connection networks. Reconfigurable devices such as CPLDs and FPGAs contribute the realization of a scalable architecture with the ultra high speed of computation. Based on the proposed architecture, more than several thousands of binary neurons can be realized on one FPGA chip.
Źródło:
Control and Cybernetics; 2002, 31, 2; 271-296
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stability and accuracy functions in multicriteria combinatorial optimization problem with [Sigma]-MINMAX and [Sigma]-MINMIN partial criteria
Autorzy:
Libura, M.
Nikulin, Y.
Powiązania:
https://bibliotekanauki.pl/articles/970484.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
wielokryterialna optymalizacja kombinatoryczna
analiza wrażliwości
funkcje stabilności i dokładności
optimum Pareto i leksykograficzne
multicriteria combinatorial optimization
sensitivity analysis
stability and accuracy functions
Pareto and lexicographic optima
Opis:
We consider a vector generic combinatorial optimization problem in which initial coefficients of objective functions are subject to perturbations. For Pareto and lexicographic principles of efficiency we introduce appropriate measures of quality of a given feasible solution from the point of view of its stability. These measures correspond to so-called stability and accuracy functions denned earlier for scalar optimization problems. Then we study properties of such functions and calculate the maximal norms of perturbations for which an efficient solution preserves the efficiency.
Źródło:
Control and Cybernetics; 2004, 33, 3; 511-524
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Declarativity in modelling and problem solving
Autorzy:
Niederliński, A.
Powiązania:
https://bibliotekanauki.pl/articles/205883.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
język symulacyjny
język wysokiego poziomu
optymalizacja kombinatoryczna
CHIP
CLP
combinatorial optimisation
constraint solving
declarative programming
high level language
logic programming
logic programming languages
Prolog
simulation language
Opis:
The paper discusses a new trend in the modelling software for combinatorial and mixed combinatorial-continuous decision problems. The trend, aiming at solving those problems by the simple activity of properly describing them, is best exemplified by a constantly inereasing spectrum of Constraint Logic Programming (CLP) languages. The first such language was Prolog. After a short historical survey concentrating mainly on Prolog, main characteristics of a modern, commercially successful CLP language - CHIP - are presented, discussed and illustrated. The CLP approach to problem solving is compared with traditional Operation Research approaches.
Źródło:
Control and Cybernetics; 2000, 29, 1; 325-339
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies