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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-15 z 15
    Tytuł:
    A Problem of Detecting Stops While Tracking Moving Objects Under the Stream Processing Regime
    Autorzy:
    Białoń, Paweł M.
    Powiązania:
    https://bibliotekanauki.pl/articles/27312949.pdf
    Data publikacji:
    2023
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    algorithm complexity
    GPS monitoring
    object tracking
    physical activity monitoring
    stream processing
    Opis:
    The tracking of moving objects with the use of GPS/GNSS or other techniques is relied upon in numerous applications, from health monitoring and physical activity support, to social investigations to detection of fraud in transportation. While monitoring movement, a common subtask consists in determining the object’s moving periods, and its immobility periods. In this paper, we isolate the mathematical problem of automatic detection of a stop of tracking objects under the stream processing regime (ideal data processing algorithm regime) in which one is allowed to use only a constant amount of memory, while the stream of GNSS positions of the tracked object increases in size. We propose an approximation scheme of the stop detection problem based on the fuzziness in the approximation of noise level related to the position reported by GNSS. We provide a solving algorithm that determines some upper bounds for the problem’s complexity. We also provide an experimental illustration of the problem at hand.
    Źródło:
    Journal of Telecommunications and Information Technology; 2023, 4; 123-132
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Noise effects in the quantum search algorithm from the viewpoint of computational complexity
    Autorzy:
    Gawron, P.
    Klamka, J.
    Winiarczyk, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/331292.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    algorytm kwantowy
    szum kwantowy
    złożoność algorytmu
    quantum algorithms
    quantum noise
    algorithm complexity
    Opis:
    We analyse the resilience of the quantum search algorithm in the presence of quantum noise modelled as trace preserving completely positive maps. We study the influence of noise on the computational complexity of the quantum search algorithm. We show that it is only for small amounts of noise that the quantum search algorithm is still more efficient than any classical algorithm.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2012, 22, 2; 493-499
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Selected multicriteria shortest path problems: An analysis of complexity, models and adaptation of standard algorithms
    Autorzy:
    Tarapata, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/929638.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    problem najkrótszej ścieżki
    złożoność algorytmu
    algorytm aproksymacji
    multiobjective shortest path
    stochastic shortest path
    algorithm complexity
    routing problem
    terrain-based modeling
    approximation algorithm
    Opis:
    The paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multiobjective shortest path (MOSP) problems is given. Different models of MOSP problems are discussed in detail. Methods of solving the formulated optimization problems are presented. An analysis of the complexity of the presented methods and ways of adapting of classical algorithms for solving multiobjective shortest path problems are described. A comparison of the effectiveness of solving selected MOSP problems defined as mathematical programming problems (using the CPLEX 7.0 solver) and multi-weighted graph problems (using modified Dijkstra’s algorithm) is given. Experimental results of using the presented methods for multicriteria path selection in a terrain-based grid network are given.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2007, 17, 2; 269-287
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A self–stabilizing algorithm for finding weighted centroid in trees
    Autorzy:
    Bielak, H.
    Pańczyk, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/106176.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    self-stabilizing algorithm
    tree networks
    time complexity
    Opis:
    In this paper we present some modification of the Blair and Manne algorithm for finding the center of a tree network in the distributed, self-stabilizing environment. Their algorithm finds n/2 -separator of a tree. Our algorithm finds weighted centroid, which is direct generalization of the former one for tree networks with positive weights on nodes. Time complexity of both algorithms is O(n2), where n is the number of nodes in the network.
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2012, 12, 2; 27-37
    1732-1360
    2083-3628
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A New Optimization Algorithm for Dilation and Erosion
    Autorzy:
    Yin, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/108794.pdf
    Data publikacji:
    2011
    Wydawca:
    Społeczna Akademia Nauk w Łodzi
    Tematy:
    dilation
    erosion
    optimization
    iteration algorithm
    time complexity analysis
    Opis:
    Effectively optimizing dilation and erosion is an extensively studied but not completely resolved problem. In this paper, a new optimization algorithm is proposed to improve the efficiency of dilation and erosion. Four notions are given to define the edges for any simply connected structuring element (SE). An assistant algorithm is proposed to detect these edges. Based on these notions, three iteration equations can be derived, which redefine dilation and erosion as iteration calculation. Time complexity of the new algorithm is reduced to O(n³). In addition, the new algorithm is suitable for online applications without the decomposition of SE. Simulation shows that with the same parameters, the performance of the new algorithm is better than that of Yang's algorithm.
    Źródło:
    Journal of Applied Computer Science Methods; 2011, 3 No. 1; 5-16
    1689-9636
    Pojawia się w:
    Journal of Applied Computer Science Methods
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Decomposition and the interaction decoupling mode in electrical systems analysis
    Autorzy:
    Płaczek, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/97258.pdf
    Data publikacji:
    2016
    Wydawca:
    Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
    Tematy:
    system complexity
    hierarchy
    decomposition
    coordination
    system analysis
    algorithm concurrence
    Opis:
    Decomposition is the best method to analyze complicated systems. The whole system is divided into a set of smaller parts, i.e. subsystems. These items are connected to each other by input and output interfaces. Every subsystem could be analyzed using separate algorithms and procedures that are more suitable for solving the local task. In the article, a complicated electrical system is decomposed and the interaction decoupling mode is used to coordinate the local task solution. Each of the first–level subsystems, such as an optimization problem, is defined completely independently from the other problems. The subsystems are instructed to select the local input as well as the local interface output in an optimal fashion. The local task's solution depends not only on the internal subsystems’ parameters, but on the value of interfaces too. To achieve the global task solution, local tasks have to be coordinated using an appropriate coordination principle.
    Źródło:
    Computer Applications in Electrical Engineering; 2016, 14; 187-200
    1508-4248
    Pojawia się w:
    Computer Applications in Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A primal-infeasible interior point algorithm for linearly constrained convex programming
    Autorzy:
    Wang, Y.
    Fei, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/969664.pdf
    Data publikacji:
    2009
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    linearly constrained convex programming
    primal-infeasible interior point algorithm
    polynomial complexity
    Opis:
    In this paper a primal-infeasible interior point algorithm is proposed for linearly constrained convex programming. A positive primal-infeasible dual-feasible point can be taken as the starting point of this algorithm in a large region. At each iterates it requires to solve approximately a nonlinear system. The polynomial complexity of the algorithm is obtained. It is shown that, after finite iterations a sufficiently good approximation to the optimal point is found, or there is no optimal point in a large region.
    Źródło:
    Control and Cybernetics; 2009, 38, 3; 687-704
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    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ł
    Tytuł:
    The Effect of Dual Hyperparameter Optimization on Software Vulnerability Prediction Models
    Autorzy:
    Bassi, Deepali
    Singh, Hardeep
    Powiązania:
    https://bibliotekanauki.pl/articles/2203949.pdf
    Data publikacji:
    2023
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    software vulnerability
    hyperparameter optimization
    machine learning algorithm
    data balancing techniques
    data complexity measures
    Opis:
    Background: Prediction of software vulnerabilities is a major concern in the field of software security. Many researchers have worked to construct various software vulnerability prediction (SVP) models. The emerging machine learning domain aids in building effective SVP models. The employment of data balancing/resampling techniques and optimal hyperparameters can upgrade their performance. Previous research studies have shown the impact of hyperparameter optimization (HPO) on machine learning algorithms and data balancing techniques. Aim: The current study aims to analyze the impact of dual hyperparameter optimization on metrics-based SVP models. Method: This paper has proposed the methodology using the python framework Optuna that optimizes the hyperparameters for both machine learners and data balancing techniques. For the experimentation purpose, we have compared six combinations of five machine learners and five resampling techniques considering default parameters and optimized hyperparameters. Results: Additionally, the Wilcoxon signed-rank test with the Bonferroni correction method was implied, and observed that dual HPO performs better than HPO on learners and HPO on data balancers. Furthermore, the paper has assessed the impact of data complexity measures and concludes that HPO does not improve the performance of those datasets that exhibit high overlap. Conclusion: The experimental analysis unveils that dual HPO is 64% effective in enhancing the productivity of SVP models.
    Źródło:
    e-Informatica Software Engineering Journal; 2023, 17, 1; art. no. 230102
    1897-7979
    Pojawia się w:
    e-Informatica Software Engineering Journal
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A locally polynomial method for solving a system of linear inequalities
    Autorzy:
    Evtushenko, Yuri
    Szkatuła, Krzysztof
    Tretyakov, Alexey
    Powiązania:
    https://bibliotekanauki.pl/articles/2183463.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    linear programming
    system of linear inequalities
    computational complexity
    locally-polynomial algorithm
    convergence rate
    Opis:
    The paper proposes a method for solving systems of linear inequalities. This method determines in a finite number of iterations whether the given system of linear ineqalities has a solution. If it does, the solution for the given system of linear inequalities is provided. The computational complexity of the proposed method is locally polynomial.
    Źródło:
    Control and Cybernetics; 2021, 50, 2; 301--314
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Hardware-Efficient Structure of the Accelerating Module for Implementation of Convolutional Neural Network Basic Operation
    Autorzy:
    Cariow, A.
    Cariowa, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/114320.pdf
    Data publikacji:
    2018
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    convolution neural network
    Winograd’s minimal filtering
    algorithm
    implementation complexity reduction
    FPGA implementation
    Opis:
    This paper presents a structural design of the hardware-efficient module for implementation of convolution neural network (CNN) basic operation with reduced implementation complexity. For this purpose we utilize some modification of the Winograd’s minimal filtering method as well as computation vectorization principles. This module calculate inner products of two consecutive segments of the original data sequence, formed by a sliding window of length 3, with the elements of a filter impulse response. The fully parallel structure of the module for calculating these two inner products, based on the implementation of a naïve method of calculation, requires 6 binary multipliers and 4 binary adders. The use of the Winograd’s minimal filtering method allows to construct a module structure that requires only 4 binary multipliers and 8 binary adders. Since a high-performance convolutional neural network can contain tens or even hundreds of such modules, such a reduction can have a significant effect.
    Źródło:
    Measurement Automation Monitoring; 2018, 64, 2; 40-42
    2450-2855
    Pojawia się w:
    Measurement Automation Monitoring
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Internet shopping optimization problem
    Autorzy:
    Błażewicz, J.
    Kovalyov, M. Y.
    Musiał, J.
    Urbański, A. P.
    Wojciechowski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/907755.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    algorytm
    złożoność obliczeniowa
    algorytm kombinatoryczny
    optymalizacja
    zakupy internetowe
    algorithm
    computational complexity
    combinatorial algorithms
    optimization
    Internet shopping
    Opis:
    A high number of Internet shops makes it difficult for a customer to review manually all the available offers and select optimal outlets for shopping. A partial solution to the problem is brought by price comparators which produce price rankings from collected offers. However, their possibilities are limited to a comparison of offers for a single product requested by the customer. The issue we investigate in this paper is a multiple-item multiple-shop optimization problem, in which total expenses of a customer to buy a given set of items should be minimized over all available offers. In this paper, the Internet Shopping Optimization Problem (ISOP) is defined in a formal way and a proof of its strong NP-hardness is provided. We also describe polynomial time algorithms for special cases of the problem.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 385-390
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Spanning trees with many or few colors in edge-colored graphs
    Autorzy:
    Broersma, Hajo
    Li, Xueliang
    Powiązania:
    https://bibliotekanauki.pl/articles/971955.pdf
    Data publikacji:
    1997
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    edge-coloring
    spanning tree
    matroid (intersection)
    complexity
    NP-complete
    NP-hard
    polynomial algorithm
    (minimum) dominating set
    Opis:
    Given a graph G = (V,E) and a (not necessarily proper) edge-coloring of G, we consider the complexity of finding a spanning tree of G with as many different colors as possible, and of finding one with as few different colors as possible. We show that the first problem is equivalent to finding a common independent set of maximum cardinality in two matroids, implying that there is a polynomial algorithm. We use the minimum dominating set problem to show that the second problem is NP-hard.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1997, 17, 2; 259-269
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The average time complexity of probabilistic algorithms for finding generators in finite cyclic groups
    Autorzy:
    Adamski, T.
    Nowakowski, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/202161.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    probabilistic algorithm
    average time complexity
    group generator
    cyclic groups
    primitive roots
    primitive polynomials
    algorytm probabilistyczny
    generator grupy
    grupy cykliczne
    wielomian
    Opis:
    Generators of finite cyclic groups play important role in many cryptographic algorithms like public key ciphers, digital signatures, entity identification and key agreement algorithms. The above kinds of cryptographic algorithms are crucial for all secure communication in computer networks and secure information processing (in particular in mobile services, banking and electronic administration). In the paper, proofs of correctness of two probabilistic algorithms (for finding generators of finite cyclic groups and primitive roots) are given along with assessment of their average time computational complexity.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 4; 989-996
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    O programie badawczym teorii inteligentnego projektu
    On the Research Program of Intelligent Design Theory
    Autorzy:
    Sagan, Dariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/553210.pdf
    Data publikacji:
    2013
    Wydawca:
    Uniwersytet Zielonogórski. Instytut Filozofii
    Tematy:
    nieredukowalna złożoność
    wyspecyfikowana złożoność
    informacja
    Biologic Institute
    oznaki projektu
    ograniczenia ewolucji
    „śmieciowy” DNA
    algorytm genetyczny
    steganografia
    irreducible complexity
    specified complexity
    information
    signs of design
    limits of evolution
    „junk” DNA
    genetic algorithm
    steganography
    Opis:
    Zgodnie z teorią inteligentnego projektu pewne zjawiska biologiczne i kosmiczne zostały zaprojektowane przez istotę inteligentną, która równie dobrze może być naturalna, jak nadnaturalna, a projekt ten jest wykrywalny naukowo. Krytycy wysuwają jednak zarzut, że o nienaukowym charakterze tej teorii świadczy fakt, iż nie jest ona użyteczna dla nauki, gdyż nie inspiruje nowych badań naukowych, hamując postęp nauki. Brak programu badawczego lub niedostatek realizowanych projektów badawczych dostrzegają nawet zwolennicy tej teorii, artykuł przedstawia jednak pewne możliwe w ramach teorii inteligentnego projektu badania. Chociaż z perspektywy metodologicznej opracowanie programu badawczego przez teoretyków projektu nie jest niezbędne, to realnie patrząc, ewentualny naukowy sukces teorii inteligentnego projektu zależy w dużej mierze od tego, czy zwolennicy tego ujęcia przekonają naukowców, że w jego ramach będą mogli coś robić, że może być ono dobrym, płodnym przewodnikiem badań, i dlatego wymaga od teoretyków projektu większego zaangażowania w wysiłek tworzenia i aktywnej realizacji programu badawczego niż można to było dotychczas zaobserwować z ich strony.
    According to intelligent design theory, certain biological and cosmic phenomena were designed by an intelligent being that could just as well be natural as supernatural, and this design is scientifically detectable. However, critics pose an objection that unscientific character of this theory is discernible in that it is not useful for science because it does not inspire new scientific research and thus it is stopping the progress of science. The lack of research program or scarcity of carried out research projects is recognized also by the proponents of that theory, but the article presents some possible research which intelligent design theory may inspire. Although the development of research program by design theorists is not necessary from the methodological perspective, in practice the potential scientific success of intelligent design theory depends largely on whether the proponents of this approach would convince scientists that thanks to it they can do something, that it could be a good, fruitful research guide, and thus demands more commitment of design theorists to the effort of forming and actively accomplishing a research program than it could have been observed so far.
    Źródło:
    Filozoficzne Aspekty Genezy; 2013, 10; 73-108
    2299-0356
    Pojawia się w:
    Filozoficzne Aspekty Genezy
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-15 z 15

      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