Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "algorytm A*" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 980
Tytuł:
3D Simulation of Warp Knitted Structures with a New Algorithm Based on NURBS
Symulacja 3D struktur dzianych z zastosowaniem algorytmu opartego na algorytmie NURBS
Autorzy:
Xu, H Y
Chen, N L
Jiang, J H
Jin, L X
Wang, Z X
Powiązania:
https://bibliotekanauki.pl/articles/232913.pdf
Data publikacji:
2015
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Biopolimerów i Włókien Chemicznych
Tematy:
warp knitted stitch
three-dimensional simulation
NURBS
joint of stitches
MATLAB
ścieg osnowy tkaniny
struktura dzianin
symulacja trójwymiarowy
algorytm NURBS
wspólne szwów
oprogramowanie Matlab
Opis:
In order to obtain a three-dimensional computer simulation of warp knitted structures with more flexibility and realism, a new algorithm using Matlab was developed by NURBS based on empirical geometrical loop models. With the principles of NURBS curves, once the values of data points are known, the control points with two coincidence points at the start and end points can be uncomplicatedly calculated by Matlab. Then the NURBS curve of a single typical stitch can be simulated flexibly by Matlab. A new typical stitch selected from two stitches simulated directly by the new method is redefined to improve the joint of neighboring stitches, and it is found that there are two types of redefined typical warp knitted stitches judged by whether the two under lap on the same side or not. Based on the redefined typical warp knitted stitch, two warp knitted structures are simulated regardless of the loop offset, and all the joints of stitches are smooth.
Przeprowadzono symulację komputerową struktur dzianin w wymiarze 3D, opracowując w tym celu nową procedurę opartą na algorytmie NURBS. Do tego celu wykorzystano oprogramowanie MATLAB. Symulację 3D przeprowadzono w oparciu o procedury numeryczne umożliwiające wykreślenie przestrzennych figur geometrycznych opisujących strukturę dzianin. Symulowano kształt oczek zamkniętych i otwartych podstawowych splotów kolumienkowych trykotu, sukna i aksamitu. W oparciu o 8 punktów referencyjnych zorientowano konfigurację pętli oczka i łącznika w postaci przestrzennej linii eliptycznej. Do zapisu struktury splotu kształtu oczek wykorzystywano aparat matematyczny w postaci macierzy.
Źródło:
Fibres & Textiles in Eastern Europe; 2015, 1 (109); 57-60
1230-3666
2300-7354
Pojawia się w:
Fibres & Textiles in Eastern Europe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A backstepping approach to ship course control
Autorzy:
Witkowska, A.
Tomera, M.
Śmierzchalski, R.
Powiązania:
https://bibliotekanauki.pl/articles/911245.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sterowanie nieliniowe
algorytm genetyczny
sterowanie statkiem
funkcja Lapunowa
backstepping
nonlinear control
genetic algorithms
ship control
Lyapunov function
Opis:
As an object of course control, the ship is characterised by a nonlinear function describing static manoeuvring characteristics that reflect the steady-state relation between the rudder deflection and the rate of turn of the hull. One of the methods which can be used for designing a nonlinear ship course controller is the backstepping method. It is used here for designing two configurations of nonlinear controllers, which are then applied to ship course control. The parameters of the obtained nonlinear control structures are tuned to optimise the operation of the control system. The optimisation is performed using genetic algorithms. The quality of operation of the designed control algorithms is checked in simulation tests performed on the mathematical model of a tanker. In order to obtain reference results to be used for comparison with those recorded for nonlinear controllers designed using the backstepping method, a control system with the PD controller is examined as well.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2007, 17, 1; 73-85
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A branch hash function as a method of message synchronization in anonymous P2P conversations
Autorzy:
Kobusińska, A.
Brzeziński, J.
Boroń, M.
Inatlewski, Ł.
Jabczyński, M.
Maciejewski, M.
Powiązania:
https://bibliotekanauki.pl/articles/331275.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
peer-to-peer system
synchronization algorithm
conversations
anonymity
system peer-to-peer
algorytm synchronizacji
anonimowość
Opis:
Currently existing solutions rarely protect message integrity, authenticity and user anonymity without burdening the user with details of key management. To address this problem, we present Aldeon—a protocol for anonymous group conversations in a peer-to-peer system. The efficiency of Aldeon is based on a novel tree synchronization algorithm, which is proposed and discussed in this paper. By using this algorithm, a significant reduction in the number of exchanged messages is achieved. In the paper, the formal definition of the proposed hash branch function and the proof of its efficiency are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 479-493
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparison of hole-filling methods in 3D
Autorzy:
Pérez, E.
Salamanca, S.
Merchán, P.
Adán, A.
Powiązania:
https://bibliotekanauki.pl/articles/331035.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
3D polygonal model
repairing meshes
hole filling
restoration algorithm
model wielokątny 3D
renowacja siatki
algorytm renowacji
Opis:
This paper presents a review of the most relevant current techniques that deal with hole-filling in 3D models. Contrary to earlier reports, which approach mesh repairing in a sparse and global manner, the objective of this review is twofold. First, a specific and comprehensive review of hole-filling techniques (as a relevant part in the field of mesh repairing) is carried out. We present a brief summary of each technique with attention paid to its algorithmic essence, main contributions and limitations. Second, a solid comparison between 34 methods is established. To do this, we define 19 possible meaningful features and properties that can be found in a generic hole-filling process. Then, we use these features to assess the virtues and deficiencies of the method and to build comparative tables. The purpose of this review is to make a comparative hole-filling state-of-the-art available to researchers, showing pros and cons in a common framework.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 885-903
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparison of nature inspired algorithms for the quadratic assignment problem
Autorzy:
Chmiel, W.
Kadłuczka, P.
Kwiecień, J.
Filipowicz, B.
Powiązania:
https://bibliotekanauki.pl/articles/202135.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
permutation problem
quadratic assignment problem
ant algorithm
bees algorithm
problem permutacji
problem przydziału kwadratowego
algorytm Ant Colony
algorytm pszczół
Opis:
This paper presents an application of the ant algorithm and bees algorithm in optimization of QAP problem as an example of NP-hard optimization problem. The experiments with two types of algorithms: the bees algorithm and the ant algorithm were performed for the test instances of the quadratic assignment problem from QAPLIB, designed by Burkard, Karisch and Rendl. On the basis of the experiments results, an influence of particular elements of algorithms, including neighbourhood size and neighbourhood search method, will be determined.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 4; 513-522
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A control algorithm for joint flight of a group of drones
Autorzy:
Sabziev, Elkhan
Powiązania:
https://bibliotekanauki.pl/articles/2116418.pdf
Data publikacji:
2021
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
group flight
drone
algorithm
lot grupowy
dron
algorytm
Opis:
Using drones in groups in the military field is not a novel idea. A massive attack by a large amount of equipment is known to be very difficult to prevent. Therefore, it is a good tactic to sacrifice some of the relatively cheap drones to destroy special enemy targets in a massive attack. This raises the issue of joint control of the behaviour of a group of drones. This paper proposes a System of Systems ideology-based decision-making system that allows to individually control each drone in a group flight. An algorithm is developed that allows controlling drones by controlling their speed.
Źródło:
Zeszyty Naukowe. Transport / Politechnika Śląska; 2021, 110; 157--167
0209-3324
2450-1549
Pojawia się w:
Zeszyty Naukowe. Transport / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A differential evolution approach to dimensionality reduction for classification needs
Autorzy:
Martinović, G.
Bajer, D.
Zorić, B.
Powiązania:
https://bibliotekanauki.pl/articles/331498.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
classification
differential evolution
feature subset selection
k-nearest neighbour algorithm
wrapper method
ewolucja różnicowa
selekcja cech
algorytm najbliższego sąsiada
Opis:
The feature selection problem often occurs in pattern recognition and, more specifically, classification. Although these patterns could contain a large number of features, some of them could prove to be irrelevant, redundant or even detrimental to classification accuracy. Thus, it is important to remove these kinds of features, which in turn leads to problem dimensionality reduction and could eventually improve the classification accuracy. In this paper an approach to dimensionality reduction based on differential evolution which represents a wrapper and explores the solution space is presented. The solutions, subsets of the whole feature set, are evaluated using the k-nearest neighbour algorithm. High quality solutions found during execution of the differential evolution fill the archive. A final solution is obtained by conducting k-fold cross-validation on the archive solutions and selecting the best one. Experimental analysis is conducted on several standard test sets. The classification accuracy of the k-nearest neighbour algorithm using the full feature set and the accuracy of the same algorithm using only the subset provided by the proposed approach and some other optimization algorithms which were used as wrappers are compared. The analysis shows that the proposed approach successfully determines good feature subsets which may increase the classification accuracy.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 1; 111-122
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A factor graph based genetic algorithm
Autorzy:
Helmi, B. H.
Rahmani, A. T.
Pelikan, M.
Powiązania:
https://bibliotekanauki.pl/articles/330811.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optimization problem
genetic algorithm
estimation
distribution algorithm
factor graph
matrix factorization
problem optymalizacji
algorytm genetyczny
algorytm estymacji rozkładu
faktoryzacja macierzy
Opis:
We propose a new linkage learning genetic algorithm called the Factor Graph based Genetic Algorithm (FGGA). In the FGGA, a factor graph is used to encode the underlying dependencies between variables of the problem. In order to learn the factor graph from a population of potential solutions, a symmetric non-negative matrix factorization is employed to factorize the matrix of pair-wise dependencies. To show the performance of the FGGA, encouraging experimental results on different separable problems are provided as support for the mathematical analysis of the approach. The experiments show that FGGA is capable of learning linkages and solving the optimization problems in polynomial time with a polynomial number of evaluations.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 621-633
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems
Autorzy:
Arangú, M.
Salido, M. A.
Powiązania:
https://bibliotekanauki.pl/articles/930140.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
problemy z ograniczeniami
technika filtrowania
algorytm zgodności
constraint satisfaction problems
filtering techniques
Opis:
Constraint programming is a powerful software technology for solving numerous real-life problems. Many of these problems can be modeled as Constraint Satisfaction Problems (CSPs) and solved using constraint programming techniques. However, solving a CSP is NP-complete so filtering techniques to reduce the search space are still necessary. Arcconsistency algorithms are widely used to prune the search space. The concept of arc-consistency is bidirectional, i.e., it must be ensured in both directions of the constraint (direct and inverse constraints). Two of the most well-known and frequently used arc-consistency algorithms for filtering CSPs are AC3 and AC4. These algorithms repeatedly carry out revisions and require support checks for identifying and deleting all unsupported values from the domains. Nevertheless, many revisions are ineffective, i.e., they cannot delete any value and consume a lot of checks and time. In this paper, we present AC4-OP, an optimized version of AC4 that manages the binary and non-normalized constraints in only one direction, storing the inverse founded supports for their later evaluation. Thus, it reduces the propagation phase avoiding unnecessary or ineffective checking. The use of AC4-OP reduces the number of constraint checks by 50% while pruning the same search space as AC4. The evaluation section shows the improvement of AC4-OP over AC4, AC6 and AC7 in random and non-normalized instances.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 4; 733-744
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A genatic algorithm how to solve a puzzle and its using in cartography
Algorytm genetyczny do składania powierzchni z fragmentów i jego zastosowania w kartografii
Autorzy:
Bartoněk, D.
Powiązania:
https://bibliotekanauki.pl/articles/341415.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Przyrodniczy we Wrocławiu
Tematy:
algorytm genetyczny
analiza skupień
kształt
fragmenty
granice figur
kod łańcuchowy
optymalizacja
funkcja dopasowania
kartogramy
genetic algorithms
cluster analysis
shape
fragments
shape boundary
string code
optimization
fitness function
cartograms
Opis:
Genetic algorithms represent an up-to-date method of process optimization, where other solutions have failed or haven't given any satisfactory results. One of these processes is puzzle solving, where fragments have to be placed into the defined shape in such a way so that no fragment should mutually overlay and the whole shape area will be filled with all of these fragments. A genetic algorithm solving this task including an exact formulation and a definition of the initial conditions based on cluster analysis has been described in this paper. The algorithm efficiency will be tested in diploma works in Institute of Geodesy, Faculty of Civil Engineering, University of Technology, Brno. The results will be used in the application for cartograms creation.
Algorytmy genetyczne reprezentują nowoczesne metody optymalizacji procesów, dla których inne rozwiązania zawiodły lub nie dały satysfakcjonujących rezultatów. Jednym z takich procesów jest rozwiązywanie układanek - puzli, w których fragmenty muszą być wstawione w zdefiniowany kształt w ten sposób, aby żadne się nawzajem nie nakładały, a kształt zawierał wszystkie zadane fragmenty. Praca niniejsza zawiera opis algorytmu genetycznego rozwiązującego takie zadanie wraz ze ścisłą formułą rozwiązania oraz definicją warunków początkowych, bazującą na analizie skupień. Skuteczność algorytmu będzie testowana w pracy dyplomowej w Instytucie Geodezji na Wydziale Budownictwa, Politechniki w Brnie. Rezultaty zostaną wykorzystane przy tworzeniu kartogramów.
Źródło:
Acta Scientiarum Polonorum. Geodesia et Descriptio Terrarum; 2005, 4, 2; 15-23
1644-0668
Pojawia się w:
Acta Scientiarum Polonorum. Geodesia et Descriptio Terrarum
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A general iterative solver for unbalanced inconsistent transportation problems
Autorzy:
Carp, D.
Popa, C.
Serban, C.
Powiązania:
https://bibliotekanauki.pl/articles/223848.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
inconsistent linear inequalities
least squares solutions
projection-type algorithm
Kaczmarz Extended
transportation problem
simplex algorithm
Han’s algorithm
problemy transportowe
algorytm Simplex
algorytm Hana
Opis:
The transportation problem, as a particular case of a linear programme, has probably the highest relative frequency with which appears in applications. At least in its classical formulation, it involves demands and supplies. When, for practical reasons, the total demand cannot satisfy the total supply, the problem becomes unbalanced and inconsistent, and must be reformulated as e.g. finding a least squares solution of an inconsistent system of linear inequalities. A general iterative solver for this class of problems has been proposed by S. P. Han in his 1980 original paper. The drawback of Han’s algorithm consists in the fact that it uses in each iteration the computation of the Moore-Penrose pseudoinverse numerical solution of a subsystem of the initial one, which for bigger dimensions can cause serious computational troubles. In order to overcome these difficulties we propose in this paper a general projection-based minimal norm solution approximant to be used within Han-type algorithms for approximating least squares solutions of inconsistent systems of linear inequalities. Numerical experiments and comparisons on some inconsistent transport model problems are presented.
Źródło:
Archives of Transport; 2016, 37, 1; 7-13
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A generalized varying-domain optimization method for fuzzy goal programming with priorities based on a genetic algorithm
Autorzy:
Li, S. Y.
Hu, C. F.
Teng, C. J.
Powiązania:
https://bibliotekanauki.pl/articles/970454.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
rozmyte programowanie celowe
priorytet
algorytm genetyczny
fuzzy goal programming
priorities
SQP
genetic algorithm
GENOCOP III
Opis:
This paper proposes a generalized domain optimization method for fuzzy goal programming with different priorities. According to the three possible styles of the objective function, the domain optimization method and its generalization are correspondingly proposed. This method can generate the results consistent with the decision-maker's priority expectations, according to which the goal with higher priority may have higher level of satisfaction. However, the reformulated optimization problem may be nonconvex for the reason of the nature of the original problem and the introduction of the varying-domain optimization method. It is possible to obtain a local optimal solution for nonconvex programming by the SQP algorithm. In order to get the global solution of the new programming problem, the co-evolutionary genetic algorithm, called GENOCOP III, is used instead of the SQP method. In this way the decision-maker can get. the optimum of the optimization problem. We demonstrate the power of this proposed method based on genetic algorithm by illustrative examples.
Źródło:
Control and Cybernetics; 2004, 33, 4; 633-652
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A genetic algorithm based optimized convolutional neural network for face recognition
Autorzy:
Karlupia, Namrata
Mahajan, Palak
Abrol, Pawanesh
Lehana, Parveen K.
Powiązania:
https://bibliotekanauki.pl/articles/2201023.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
convolutional neural network
genetic algorithm
deep learning
evolutionary technique
sieć neuronowa konwolucyjna
algorytm genetyczny
uczenie głębokie
technika ewolucyjna
Opis:
Face recognition (FR) is one of the most active research areas in the field of computer vision. Convolutional neural networks (CNNs) have been extensively used in this field due to their good efficiency. Thus, it is important to find the best CNN parameters for its best performance. Hyperparameter optimization is one of the various techniques for increasing the performance of CNN models. Since manual tuning of hyperparameters is a tedious and time-consuming task, population based metaheuristic techniques can be used for the automatic hyperparameter optimization of CNNs. Automatic tuning of parameters reduces manual efforts and improves the efficiency of the CNN model. In the proposed work, genetic algorithm (GA) based hyperparameter optimization of CNNs is applied for face recognition. GAs are used for the optimization of various hyperparameters like filter size as well as the number of filters and of hidden layers. For analysis, a benchmark dataset for FR with ninety subjects is used. The experimental results indicate that the proposed GA-CNN model generates an improved model accuracy in comparison with existing CNN models. In each iteration, the GA minimizes the objective function by selecting the best combination set of CNN hyperparameters. An improved accuracy of 94.5% is obtained for FR.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2023, 33, 1; 21--31
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A genetic algorithm for the maximum 2-packing set problem
Autorzy:
Trejo-Sánchez, Joel Antonio
Fajardo-Delgado, Daniel
Gutierrez-Garcia, J. Octavio
Powiązania:
https://bibliotekanauki.pl/articles/330154.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
maximum 2-packing set
genetic algorithms
graph algorithms
algorytm genetyczny
algorytm grafowy
Opis:
Given an undirected connected graph G = (V, E), a subset of vertices S is a maximum 2-packing set if the number of edges in the shortest path between any pair of vertices in S is at least 3 and S has the maximum cardinality. In this paper, we present a genetic algorithm for the maximum 2-packing set problem on arbitrary graphs, which is an NP-hard problem. To the best of our knowledge, this work is a pioneering effort to tackle this problem for arbitrary graphs. For comparison, we extended and outperformed a well-known genetic algorithm originally designed for the maximum independent set problem. We also compared our genetic algorithm with a polynomial-time one for the maximum 2-packing set problem on cactus graphs. Empirical results show that our genetic algorithm is capable of finding 2-packing sets with a cardinality relatively close (or equal) to that of the maximum 2-packing sets. Moreover, the cardinality of the 2-packing sets found by our genetic algorithm increases linearly with the number of vertices and with a larger population and a larger number of generations. Furthermore, we provide a theoretical proof demonstrating that our genetic algorithm increases the fitness for each candidate solution when certain conditions are met.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 1; 173-184
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A hybrid approach for scheduling transportation networks
Autorzy:
Dridi, M.
Kacem, I.
Powiązania:
https://bibliotekanauki.pl/articles/907640.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system transportowy
regulacja ruchu
algorytm genetyczny
optymalizacja wielokryterialna
transportation systems
traffic regulation
genetic algorithm
multicriteria optimization
Opis:
In this paper, we consider a regulation problem of an urban transportation network. From a given timetable, we aim to find a new schedule of multiple vehicles after the detection of a disturbance at a given time. The main objective is to find a solution maximizing the level of service for all passengers. This problem was intensively studied with evolutionary approaches and multi-agent techniques, but without identifying its type before. In this paper, we formulate the problem as a classical one in the case of an unlimited vehicle capacity. In the case of a limited capacity and an integrity constraint, the problem becomes difficult to solve. Then, a new coding and well-adapted operators are proposed for such a problem and integrated in a new evolutionary approach.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 397-409
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 980

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