Temat: Search Algorithm - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: B-TREE algorithm complexity analysis to evaluate the feasibility of its application in the university course timetabling problem
Autorzy:: Cruz Chávez, M. A.
Martínez Oropeza, A.
Powiązania:: https://bibliotekanauki.pl/articles/91757.pdf
Data publikacji:: 2013
Wydawca:: Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:: B-TREE
algorithm
Binary Search Algorithms
complexity analysis
University Course Timetabling Problem
UCTP
Opis:: This paper presents a comparative analysis of complexity between the B-TREE and the Binary Search Algorithms, both theoretically and experimentally, to evaluate their efficiency in finding overlap of classes for students and teachers in the University Course Timetabling Problem (UCTP). According to the theory, B-TREE Search complexity is lower than Binary Search. The performed experimental tests showed the B-TREE Search Algorithm is more efficient than Binary Search, but only using a dataset larger than 75 students per classroom.
Źródło:: Journal of Artificial Intelligence and Soft Computing Research; 2013, 3, 4; 251-263
2083-2567
2449-6499
Pojawia się w:: Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Derivative free optimal thrust allocation in ship dynamic positioning based on direct search algorithms
Autorzy:: Valčić, M.
Prpić-Oršić, J.
Powiązania:: https://bibliotekanauki.pl/articles/116991.pdf
Data publikacji:: 2020
Wydawca:: Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:: algorithm
dynamic positioning
direct search algorithms
sequential quadratic programing (SQP)
Singular Values Decomposition (SVD)
Lagrangian Multiplier Method (LMM)
Direct Search (DS)
Mesh Adaptive Direct Search (MADS)
Opis:: In dynamic positioning systems, nonlinear cost functions, as well as nonlinear equality and inequality constraints within optimal thrust allocation procedures cannot be handled directly by means of the solvers like industry-standardized quadratic programing (QP), at least not without appropriate linearization technique applied, which can be computationally very expensive. Thus, if optimization requirements are strict, and problem should be solved for nonlinear objective function with nonlinear equality and inequality constraints, than one should use some appropriate nonlinear optimization technique. The current state-of-the-art in nonlinear optimization for gradient-based algorithms is surely the sequential quadratic programing (SQP), both for general applications and specific thrust allocation problems. On the other hand, in recent time, one can also notice the increased applications of gradient-free optimization methods in various engineering problems. In this context, the implementation of selected derivative free direct search algorithms in optimal thrust allocation is proposed and discussed in this paper, and avenues for future research are provided.
Źródło:: TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2020, 14, 2; 309-314
2083-6473
2083-6481
Pojawia się w:: TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Automatic search of rational self-equivalences
Autorzy:: Stępień, L.
Stępień, M. R.
Powiązania:: https://bibliotekanauki.pl/articles/950276.pdf
Data publikacji:: 2018
Wydawca:: Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:: rational self-equivalences
automorphisms of Witt rings
Witt rings
algebra
algorithm
automatic search
automorfizm
pierścień Witta
algorytm
Opis:: Two Witt rings that are not strongly isomorphic (i.e., two Witt rings over two fields that are not Witt equivalent) have different groups of strong automorphisms. Therefore, the description of a group of strong automorphisms is different for almost every Witt ring, which requires the use various tools in proofs. It is natural idea to use computers to generate strong automorphisms of the Witt rings, which is especially effective in the case of the finitely generated Witt rings, where a complete list of strong automorphisms can be created. In this paper we present the algorithm that was used to generate strong automorphisms from the infinite group of strong automorphisms of the Witt ring of rational numbers W(Q).
Źródło:: Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2018, 23; 67-74
2450-9302
Pojawia się w:: Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Search Algorithm" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język