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ę "algorithms" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 506
Tytuł:
A survey of parallel algorithms
Autorzy:
Bojańczyk, A.
Powiązania:
https://bibliotekanauki.pl/articles/747541.pdf
Data publikacji:
1978
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Algorithms
Opis:
Artykuł nie zawiera streszczenia
After a description of the basic concepts, a model of a parallel computer is formulated. The main results about complexity of parallel algorithms for the calculation of linear recurrence relations are described.     Constant speed-up for the nonlinear case is also mentioned. The parallel algorithms for a system of linear equations with a tridiagonal, triangular and     full matrix are discussed. The method of problem- and algorithm-decomposition is demonstrated. Asynchronous algorithms for an MIMD-type computer are defined,     and with some numerical examples for linear and nonlinear equations, these ideas are demonstrated.
Źródło:
Mathematica Applicanda; 1978, 6, 12
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of material distribution for forged automotive components using hybrid optimization techniques
Autorzy:
Sebastjan, Przemysław
Kuś, Wacław
Powiązania:
https://bibliotekanauki.pl/articles/29520109.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
shape optimization
hybrid optimization
genetic algorithms
evolutionary algorithms
gradient algorithms
auto-motive part optimization
Opis:
The paper deals with the problem of optimal material distribution inside the provided design area. Optimization based on deterministic and stochastic algorithms is used to obtain the best result on the basis of the proposed objective function and constraints. The optimization of the shock absorber is used as an example of the described methods. One of the main difficulties addressed is the manufacturability of the optimized part intended for the forging process. Additionally, nonlinear buckling simulation with the use of the finite element method is used to solve the misuse case of shock absorber compression, where the shape of the optimized part has a key role in the total strength of the automotive damper. All of that, together with the required design precision, creates the nontrivial constrained optimization problem solved using the parametric, implicit geometry representation and a combination of stochastic and deterministic algorithms used with parallel design processing. Two methods of optimization are examined and compared in terms of the total amount of function calls, final design mass, and feasibility of the resultant design. Also, the amount of parameters used for the implicit geometry representation is greatly reduced compared to existing schemes presented in the literature. The problem addressed in this article is strongly inspired by the actual industrial example of the mass minimization process, but it is more focused on the actual manufacturability of the resultant component and admissible solving time. Commercially accessible software combined with authors’ procedures is used to resolve the material distribution task, which makes the proposed method universal and easily adapted to other fields of the optimization of mechanical elements.
Źródło:
Computer Methods in Materials Science; 2021, 21, 2; 63-74
2720-4081
2720-3948
Pojawia się w:
Computer Methods in Materials Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Remarks on some learning algorithms
Uwagi na temat komputerowych algorytmów uczenia się
Autorzy:
Domański, Czesław
Pekasiewicz, Dorota
Powiązania:
https://bibliotekanauki.pl/articles/904617.pdf
Data publikacji:
1997
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
algorithmic procedure
heuristic procedure
learning algorithms
backpropagation algorithms
Opis:
In this paper we present some problems concerning artificial intelligence. In the first two points there are presented algorithmic and heuristic procedures, which are applied in solving problems and making optimal decision for the fixed states as follows: beginning state, set of all states of a problem, subset of final states. The fundamental part of the paper discusses three leaming-algorithms: ID3, AQ and backpropagation, owing to which computer basing on a given sample is to create a general formula or rule and to make a decision which is a solution of the problem. The last section of the paper includes a short description of the predictive accuracy of the algorithms.
Źródło:
Acta Universitatis Lodziensis. Folia Oeconomica; 1997, 141
0208-6018
2353-7663
Pojawia się w:
Acta Universitatis Lodziensis. Folia Oeconomica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic algorithms in topological design of telecommunication networks
Autorzy:
Karaś, P.
Powiązania:
https://bibliotekanauki.pl/articles/307692.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
topological design
network optimisation
heuristic algorithms
genetic algorithms
Opis:
The paper addresses the generic topological network design problem and considers the use of various heuristic algorithms for solving the problem. The target of the optimisation is to determine a network structure and demand allocation pattern that would minimise the cost of the network, which is given by fixed installation costs of nodes and links and variable link capacity costs described bv linear or concave functions. Input data for the optimisation consists of a list of potential node and link locations and their costs and a set of demands defined between the nodes. Since the problem is known to be NP-hard. The use of specialised heuristic algorithms is proposed. The presented approaches encompass original ideas as well as selected methods described in literature and their enhancements. The algorithms are based on the following ideas and methods: shifting of individual flows, local and global restoration of flows from chosen links or nodes, Yaged algorithm for finding local minima, Minoux greedy algorithm, simulated allocation and genetic algorithms. Efficiency of each of the proposed methods is tested on a set of numerical examples.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 3; 73-82
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of genetic algorithms to the traveling salesman problem
Autorzy:
Sikora, Tomasz
Gryglewicz-Kacerka, Wanda
Powiązania:
https://bibliotekanauki.pl/articles/30148246.pdf
Data publikacji:
2023
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
evolutionary algorithms
genetic algorithms
traveling salesman problem
TSP
Opis:
The purpose of this paper was to investigate in practice the possibility of using evolutionary algorithms to solve the traveling salesman problem on a real example. The goal was achieved by developing an original implementation of the evolutionary algorithm in Python, and by preparing an example of the traveling salesman problem in the form of a directed graph representing Polish voivodship cities. As part of the work an application in Python was written. It provides a user interface which allows to set selected parameters of the evolutionary algorithm and solve the prepared problem. The results are presented in both text and graphical form. The correctness of the evolutionary algorithm's operation and the implementation was confirmed by performed tests. A large number of tested solutions (2500) and the analysis of the obtained results allowed for a conclusion that an optimal (relatively suboptimal) solution was found.
Źródło:
Applied Computer Science; 2023, 19, 2; 55-62
1895-3735
2353-6977
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary algorithms and boundary element method in generalized shape optimization
Algorytmy ewolucyjne i metoda elementów brzegowych w uogólnionej optymalizacji kształtu
Autorzy:
Burczyński, T.
Kokot, G.
Powiązania:
https://bibliotekanauki.pl/articles/279253.pdf
Data publikacji:
2003
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
evolutionary algorithms
genetic algorithms
generalized shape optimization
topology optimization
Opis:
The coupling of modern, alternative optimization methods such as evolutionary algorithms with the effective tool for analysis of mechanical structures - BEM, gives a new optimization method, which allows one to perform the generalized shape optimization (simultaneous shape and topology optimization) for elastic mechanical structures. This new evolutionary method is free from typical limitations connected with classical optimization methods. In the paper, results of researches on the application of evolutionary methods in the domain of mechanics are presented. Numerical examples for some optimization problems are presented, too.
Połączenie nowoczesnych algorytmów optymalizacji, jakimi są algorytmy ewolucyjne, z metodą elementów brzegowych pozwala opracować alternatywną metodę optymalizacji sprężystych układów mechanicznych w zakresie uogólnionej optymalizacji kształtu (połaczenie optymalizacji kształtu z optymalizacją topologiczną). Metoda ta jest pozbawiona wad związanych z typowymi klasycznymi metodami optymalizacji (ciągłość funkcji celu, wyznaczanie gradientu funkcji itp.), co znacznie rozszerza możliwości jej zastosowań. W artykule przedstawiono proponowaną metodę optymalizacji wraz z przykładami optymalizacji wybranych układów mechanicznych.
Źródło:
Journal of Theoretical and Applied Mechanics; 2003, 41, 2; 341-364
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A sequential method for the synthesis of formulae of algorithms
Autorzy:
Ovsyak, V.
Ovsyak, O.
Powiązania:
https://bibliotekanauki.pl/articles/114500.pdf
Data publikacji:
2015
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
computation models
algebra of algorithms
synthesis of algorithms
minimization of algorithm
Opis:
New method for the synthesis of algorithm formulae based on the concept of algorithm algebra is presented. The concept of algorithm algebra there is shown in papers [1-4]. The synthesis is performed in two stages. First, all sequences are formulated, which is followed by the bonding the sequences by conditions. This operation is termed by elimination. If the algorithm contains a cyclic operations, then each cyclic operation is considered as a complex one, over which the synthesis of sequences and eliminations are successively performed. Additionally, the algorithm algebra tools for transformation and minimization of algorithms are illustrated by a simple but instructive example.
Źródło:
Measurement Automation Monitoring; 2015, 61, 1; 21-23
2450-2855
Pojawia się w:
Measurement Automation Monitoring
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Microcontroller based step-up DC-DC converter driver with MPPT algorithm implemenation
Autorzy:
Tomaszuk, A.
Powiązania:
https://bibliotekanauki.pl/articles/376343.pdf
Data publikacji:
2014
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
MPPT algorithms
photovoltaic systems
Opis:
Energy efficiency is one of most critical parameters in photovoltaic (PV) systems. Overall PV system efficiency improvement may be achieved by such means as topological changes, new generations of transistor switches and/or planar magnetic components use. But on the other hand whole system must follow the wheather changes such as solar energy delivery variation due to cloud shading as well as temperature fluctuations. In such conditions a driver should dynamically track maximum power point (MPPT) of a PV array. For the purposes of better understanding PV array performance the paper shows MatLab simulation of 3.2 kWp PV array. The driver discussed works with a range of different step up DC-DC converter topologies such as bridge based topologies as well as interleaved ones. The ASCII protocol which can be implemented in PC application is responsible for working parameters settings carrying and output data logging as well as current software status check. The paper presents practical implementation of the driver as a part of larger PV system where the interleaved DC-DC converter works with 3.2 kWp PV array of ten PV modules connected in parallel. Described MPPT algorithm takes advantage of modified Perturb and Observe (P&O) method. Presented are microcontroller hardware resources utilization, functional software architecture and developped MPPT algorithm which performance is shown on the plot.
Źródło:
Poznan University of Technology Academic Journals. Electrical Engineering; 2014, 78; 233-240
1897-0737
Pojawia się w:
Poznan University of Technology Academic Journals. Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Use of Genetic Algorithms for Searching Parameter Space in Gaussian Process Modeling
Autorzy:
Krok, A.
Powiązania:
https://bibliotekanauki.pl/articles/308239.pdf
Data publikacji:
2015
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
Gaussian processes
genetic algorithms
Opis:
The aim of the paper is to present the possibilities of modeling the experimental data by Gaussian processes. Genetic algorithms are used for finding the Gaussian process parameters. Comparison of data modeling accuracy is made according to neural networks learned by Kalman filtering. Concrete hysteresis loops obtained by the experiment of cyclic loading are considered as the real data time series.
Źródło:
Journal of Telecommunications and Information Technology; 2015, 3; 58-63
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An algorithm for solving a certain sequencing problem
Autorzy:
Adrabiński, A.
Grabowski, J.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/747964.pdf
Data publikacji:
1982
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Scheduling theory, deterministic, Algorithms
Opis:
.
The authors consider the problem of nonpreemptive scheduling of n tasks in a general job shop. The objective is to find a schedule of minimum length. The algorithm presented in the paper is based on the disjunctive graph approach. Its performance is not compared with other algorithms constructed for that problem.
Źródło:
Mathematica Applicanda; 1982, 10, 18
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
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ł:
Biologically inspired methods for control of evolutionary algorithms
Autorzy:
Stańczak, J.
Powiązania:
https://bibliotekanauki.pl/articles/206262.pdf
Data publikacji:
2003
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
algorytm genetyczny
adaptacja
adaptacyjny algorytm ewolucyjny
genetic algorithms
adaptation
adaptive ewolutionary algorithms
Opis:
In this paper two methods for evolutionary algorithm control are proposed. The first one is a new method of tuning tlie probabilities of genetic operators. It is assumed in the presented approach that every member of the optimized population conducts his own ranking of genetic operators' qualities. This ranking enables computing the probabilities of execution of genetic operators. This set of probabilities is a basis of experience of every individual and according to this basis the individual chooses the operator in every iteration of the algorithm. Due to this experience one can maximize the chances of his offspring to survive. The second part of the paper deals with a self-adapting method of selection of individuals to a subsequent generation. Methods of selection applied in the evolutionary algorithms are usually inspired by nature and prefer solutions where the main role is played by randomness, competition and struggle among individuals. In the case of evolutionary algorithms, where populations of individuals are usually small, this causes a premature convergence to local minima. In order to avoid this drawback I propose to apply an approach based rather on an agricultural technique. Two new methods of object selection are proposed: a histogram selection and a mixed selection. The methods described were tested using examples based on scheduling and TSP.
Źródło:
Control and Cybernetics; 2003, 32, 2; 411-433
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary algorithm for minmax regret flow-shop problem
Autorzy:
Ćwik, M.
Józefczyk, J.
Powiązania:
https://bibliotekanauki.pl/articles/406859.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
manufacturing
flow-shop
interval uncertainty
min-max regret
heuristic algorithms
evolutionary algorithms
simulation
Opis:
The uncertain flow-shop is considered. It is assumed that processing times are not given a priori, but they belong to intervals of known bounds. The absolute regret (regret) is used to evaluate a solution (a schedule) which gives the minmax regret binary optimization problem. The evolutionary heuristic solution algorithm is experimentally compared with a simple middle interval heuristic algorithm for three machines instances. The conducted simulations confirmed the several percent advantage of the evolutionary approach.
Źródło:
Management and Production Engineering Review; 2015, 6, 3; 3-9
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Compression algorithms for multibeam sonar records
Autorzy:
Chybicki, A.
Moszyński, M.
Poćwiardowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/331502.pdf
Data publikacji:
2008
Wydawca:
Polskie Towarzystwo Akustyczne
Tematy:
compression algorithms
sonar records
hydroacoustics
Opis:
Operational requirements of multibeam sonar systems result in very large volumes of datasets stored on local hard drives of operator's station. In this context, the process of archiving acquired data becomes a crucial problem. The paper investigates various lossy and lossless compression methods that can be applied to multibeam sonar data to reduce the size of acquired files without loosing relevant information. The specific character of MBS data allows applying various signal, image and video compression methods to achieve better results than when using standard compression tools. Various techniques of reordering the data were analyzed to achieve best possible compression ratio.
Źródło:
Hydroacoustics; 2008, 11; 55-62
1642-1817
Pojawia się w:
Hydroacoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance Evaluation of Preemption Algorithms in MPLS Networks
Autorzy:
Kaczmarek, S.
Nowak, K.
Powiązania:
https://bibliotekanauki.pl/articles/226477.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
MPLS
preemption
algorithms
traffic engineering
Opis:
Preemption is a traffic engineering technique in Multiprotocol Switching Network that enables creation of high priority paths when there is not enough free bandwidth left on the route. Challenging part of any preemption method is to select the best set of paths for removal. Several heuristic methods are available but no wider comparison had been published before. In this paper, we discusses the dilemmas in implementing preemption methods are presented the simulation studyof well known existing algorithms. Based on the results, we provide recommendations for deployment of preemption for the two most common evaluation criteria: number of preemption and preempted bandwidth.
Źródło:
International Journal of Electronics and Telecommunications; 2011, 57, 2; 169-175
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 506

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