Gotowa bibliografia na temat „Algorothm”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Algorothm”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Algorothm"
Sellers, Harrell. "ADEM-DIOS: an SCF convergence algorothm for difficult cases". Chemical Physics Letters 180, nr 5 (maj 1991): 461–65. http://dx.doi.org/10.1016/0009-2614(91)85150-u.
Pełny tekst źródłaOtmar, Scherzer. "A convergence analysis of a method of steepest descent and a two–step algorothm for nonlinear ill–posed problems". Numerical Functional Analysis and Optimization 17, nr 1-2 (styczeń 1996): 197–214. http://dx.doi.org/10.1080/01630569608816691.
Pełny tekst źródłaPulatov, B. "OPTIMIZATION OF MODES OF ELECTR POWER SYSTEMS BY GENETIC ALGOROTHMS". Technical science and innovation 2019, nr 3 (18.09.2019): 224–29. http://dx.doi.org/10.51346/tstu-01.19.3.-77-0030.
Pełny tekst źródłaPetković, Dalibor, Vlastimir Nikolić, Vojislav V. Mitić i Ljubiša Kocić. "Estimation of fractal representation of wind speed fluctuation by artificial neural network with different training algorothms". Flow Measurement and Instrumentation 54 (kwiecień 2017): 172–76. http://dx.doi.org/10.1016/j.flowmeasinst.2017.01.007.
Pełny tekst źródłaRozprawy doktorskie na temat "Algorothm"
Smith, Duncan Alexander Mathematics UNSW. "The Families with Period 1 of 2-groups of Coclass 3". Awarded by:University of New South Wales. Mathematics, 2000. http://handle.unsw.edu.au/1959.4/17792.
Pełny tekst źródłaArantes, Gilz Paulo Ricardo. "Embedded and validated control algorithms for the spacecraft rendezvous". Thesis, Toulouse 3, 2018. http://www.theses.fr/2018TOU30155/document.
Pełny tekst źródłaAutonomy is one of the major concerns during the planning of a space mission, whether its objective is scientific (interplanetary exploration, observations, etc.) or commercial (service in orbit). For space rendezvous, this autonomy depends on the on-board capacity of controlling the relative movement between two spacecraft. In the context of satellite servicing (troubleshooting, propellant refueling, orbit correction, end-of-life deorbit, etc.), the feasibility of such missions is also strongly linked to the ability of the guidance and control algorithms to account for all operational constraints (for example, thruster saturation or restrictions on the relative positioning between the vehicles) while maximizing the life of the vehicle (minimizing propellant consumption). The literature shows that this problem has been intensively studied since the early 2000s. However, the proposed algorithms are not entirely satisfactory. Some approaches, for example, degrade the constraints in order to be able to base the control algorithm on an efficient optimization problem. Other methods accounting for the whole set of constraints of the problem are too cumbersome to be embedded on real computers existing in the spaceships. The main object of this thesis is the development of new efficient and validated algorithms for the impulsive guidance and control of spacecraft in the context of the so-called "hovering" phases of the orbital rendezvous, i.e. the stages in which a secondary vessel must maintain its position within a bounded area of space relatively to another main vessel. The first contribution presented in this manuscript uses a new mathematical formulation of the space constraints for the relative motion between spacecraft for the design of control algorithms with more efficient computational processing compared to traditional approaches. The second and main contribution is a predictive control strategy that has been formally demonstrated to ensure the convergence of relative trajectories towards the "hovering" zone, even in the presence of disturbances or saturation of the actuators.[...]
Streszczenia konferencji na temat "Algorothm"
Qing, Mengjiao, Fei Tang, Mengqi Qing, Weiqiang Liang, Chufei Xiao, Wen Jian, Dichen Liu i Qiang Zhao. "A Two-steps Splitting Strategy Based On Laplacian Eigenmap Algorothm For Large Power Grid With Power Wind Connected". W 2019 IEEE Innovative Smart Grid Technologies - Asia (ISGT Asia). IEEE, 2019. http://dx.doi.org/10.1109/isgt-asia.2019.8881478.
Pełny tekst źródła