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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-11 z 11
    Tytuł:
    The branch and bound algorithm for a backup virtual path assignment in survivable atm networks
    Autorzy:
    Walkowiak, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/907991.pdf
    Data publikacji:
    2002
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    automatyka
    survivable networks
    ATM
    branch and bound algorithm
    Opis:
    Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented for the local-destination rerouting strategy. The function of the flow lost due to a failure of a single link is chosen as the performance index. The problem of finding the optimal virtual path assignment is NP-complete. Therefore we develop an exact algorithm based on the branch and bound approach. Moreover, two heuristic algorithms are proposed. Numerical results are presented.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2002, 12, 2; 257-267
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An exact algorithm for design of content delivery networks in MPLS environment
    Autorzy:
    Walkowiak, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/308183.pdf
    Data publikacji:
    2004
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    content delivery network
    optimization
    branch-and-cut algorithm
    Opis:
    Content delivery network (CDN) is an efficient and inexpensive method to improve Internet service quality. In this paper we formulate an optimisation problem of replica location in a CDN using MPLS techniques. A novelty, comparing to previous work on this subject, is modelling the network flow as connection-oriented and introduction of capacity constraint on network links to the problem. Since the considered optimisation problem is NP-complete, we propose and discuss exact algorithm based on the branch-and-cut and branch-and-bound methods. We present results of numerical experiments showing comparison of branch-and-cut and branch-and-bound methods.
    Źródło:
    Journal of Telecommunications and Information Technology; 2004, 2; 13-22
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The branch and bound algorithm improvement in divisible load scheduling with result collection on heterogeneous systems by new heuristic function
    Autorzy:
    Fard, F. N.
    Mohammadi, S.
    Parvizi, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/385127.pdf
    Data publikacji:
    2012
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    divisible load scheduling
    heterogeneous systems
    branch and bound algorithm
    Opis:
    In this paper we propose a new heuristic function for branch and bound algorithm. By this function we can increase the efficiency of branch and bound algorithm. Divisible loads represent computations which can be arbitrarily divided into parts and performed independently parallel. The scheduling problem consists in distributing the load in a heterogeneous system taking into account communication and computation times, so that the whole processing time is as short as possible. Since our scheduling problem is computationally hard, we propose a branch & bound algorithm. By simulating and comparing results it is observed which this result produces better answers than other methods, it means that branch and bound algorithm have less total average of relative error percentage in the variety Heuristic functions.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2012, 6, 3; 47-50
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analysis of performance for the DIRECT global optimization algorithm
    Analiza działania algorytmu optymalizacji globalnej DIRECT
    Autorzy:
    Borowik, P.
    Chwastek, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/159401.pdf
    Data publikacji:
    2016
    Wydawca:
    Sieć Badawcza Łukasiewicz - Instytut Elektrotechniki
    Tematy:
    algorithm "branch-and-bound"
    optimization
    simulations
    algorytm "branch-and-bound"
    optymalizacja
    symulacje
    Opis:
    The usefulness of the "branch-and-bound" algorithm for solving chosen optimization problems is considered in the paper. Simulations have been carried out for chosen benchmark tasks with different complexity and number of dimensions.
    W pracy dokonano oceny użyteczności algorytmu "branch-and-bound" do rozwiązywania wybranych zadań optymalizacji. Przeprowadzono symulacje dla wybranych zadań testowych o różnej złożoności i liczbie wymiarów.
    Źródło:
    Prace Instytutu Elektrotechniki; 2016, 273; 55-62
    0032-6216
    Pojawia się w:
    Prace Instytutu Elektrotechniki
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Exact approaches to late work scheduling on unrelated machines
    Autorzy:
    Liu, Xinbo
    Wang, Wen
    Chen, Xin
    Sterna, Malgorzata
    Blazewicz, Jacek
    Powiązania:
    https://bibliotekanauki.pl/articles/11542692.pdf
    Data publikacji:
    2023
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    late work scheduling
    unrelated machine
    mathematical model
    branch algorithm
    bound algorithm
    dynamic programming
    planowanie pracy
    model matematyczny
    algorytm podziału
    algorytm ograniczeń
    programowanie dynamiczne
    Opis:
    We consider the scheduling problem on unrelated parallel machines in order to minimize the total late work. Since the problem is NP-hard, we propose a mathematical model and two dedicated exact approaches for solving it, based on the branching and bounding strategy and on enumerating combined with a dynamic programming algorithm. The time efficiencies of all three approaches are evaluated through computational experiments.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2023, 33, 2; 285--295
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Computational prediction of non-enzymatic RNA degradation patterns
    Autorzy:
    Rybarczyk, Agnieszka
    Jackowiak, Paulina
    Figlerowicz, Marek
    Blazewicz, Jacek
    Powiązania:
    https://bibliotekanauki.pl/articles/1038733.pdf
    Data publikacji:
    2016
    Wydawca:
    Polskie Towarzystwo Biochemiczne
    Tematy:
    RNA degradation
    non-enzymatic RNA hydrolysis
    branch-and-cut algorithm
    Opis:
    Since the beginning of the 21st century, an increasing interest in the research of ribonucleic acids has been observed in response to a surprising discovery of the role that RNA molecules play in the biological systems. It was demonstrated that they do not only take part in the protein synthesis (mRNA, rRNA, tRNA) but also are involved in the regulation of gene expression. Several classes of small regulatory RNAs have been discovered (e.g. microRNA, small interfering RNA, piwiRNA). Most of them are excised from specific double-stranded RNA precursors by enzymes that belong to the RNaseIII family (Drosha, Dicer or Dicer-like proteins). More recently, it has been shown that small regulatory RNAs are also generated as stable intermediates of RNA degradation (the so called RNA fragments originating from tRNA, snRNA, snoRNA etc.). Unfortunately, the mechanisms underlying biogenesis of the RNA fragments remain unclear. It is thought that several factors may be involved in the formation of the RNA fragments. The most important are the specific RNases, RNA-protein interactions and RNA structure. In this work, we focus on the RNA primary and secondary structures as factors influencing the RNA stability and consequently the pattern of RNA fragmentation. Earlier, we identified the major structural factors affecting non-enzymatic RNA degradation. Now, based on these data, we developed a new branch-and-cut algorithm that is able to predict the products of large RNA molecules' hydrolysis in vitro. We also present the experimental data that verify the results generated using this algorithm.
    Źródło:
    Acta Biochimica Polonica; 2016, 63, 4; 745-751
    0001-527X
    Pojawia się w:
    Acta Biochimica Polonica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Derivation of physically motivated constraints for efficient interval simulations applied to the analysis of uncertain dynamical systems
    Autorzy:
    Freihold, M.
    Hofer, E. P.
    Powiązania:
    https://bibliotekanauki.pl/articles/930126.pdf
    Data publikacji:
    2009
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    system Hamiltona
    algorytm rozgałęzienia
    system dynamiczny
    VALENCIA-IVP
    consistency tests for the reduction of overestimation
    identification of dynamical constraints
    Hamiltonian systems
    branch algorithm
    prune algorithm
    Opis:
    Interval arithmetic techniques such as VALENCIA-IVP allow calculating guaranteed enclosures of all reachable states of continuous-time dynamical systems with bounded uncertainties of both initial conditions and system parameters. Considering the fact that, in naive implementations of interval algorithms, overestimation might lead to unnecessarily conservative results, suitable consistency tests are essential to obtain the tightest possible enclosures. In this contribution, a general framework for the use of constraints based on physically motivated conservation properties is presented. The use of these constraints in verified simulations of dynamical systems provides a computationally efficient procedure which restricts the state enclosures to regions that are physically eaningful. A branch and prune algorithm is modified to a consistency test, which is based on these constraints. Two application scenarios are studied in detail. First, the total energy is employed as a conservation property for the analysis of mechanical systems. It is shown that conservation properties, such as the energy, are applicable to any Hamiltonian system. The second scenario is based on constraints that are derived from decoupling properties, which are considered for a high-dimensional compartment model of granulopoiesis in human blood cell dynamics.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2009, 19, 3; 485-499
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of linear functions on a cyclic permutation. Based on the random search
    Autorzy:
    Grebennik, I.
    Baranov, O.
    Chorna, A.
    Gorbacheva, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/411110.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Oddział w Lublinie PAN
    Tematy:
    combinatorial optimization
    linear function
    cyclic permutations
    random search
    branch and bound algorithm
    parallel computing
    Opis:
    For creating adequate mathematical models of combinatorial problems of constructing optimal cyclic routes, mathematical modeling and solving a number of planning and control tasks solutions of optimization problems on the set of cyclic permutations are required. Review of the publications on combinatorial optimization demonstrates that the optimization problem on the cyclic permutations have not been studied sufficiently. This paper is devoted to solving optimization problem of a linear function with linear constraints on the set of cyclic permutations. For solving problems of this class using of known methods, taking into account the properties of a combinatorial set of cyclic permutations, is proposed. For this purpose we propose a method based on the ideology of random search. Heuristic method based on the strategy of the branch and bound algorithm is proposed to solve auxiliary optimization problem of a linear function without constraints on the set of cyclic permutations. Since application of the branch and bound algorithm immediately leads to an exponential growth of the complexity with increasing the dimension of the problem a number of modifications are suggested. Modifications allow reducing computational expenses for solving higher dimension problems. The effectiveness of the proposed improvements is demonstrated by computational experiments.
    Źródło:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2016, 5, 3; 211-216
    2084-5715
    Pojawia się w:
    ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A genetic algorithm and B&B algorithm for integrated production scheduling, preventiveand corrective maintenance to save energy
    Autorzy:
    Sadiqi, Assia
    El Abbassi, Ikram
    El Barkany, Abdellah
    Darcherif, Moumen
    El Biyaali, Ahmed
    Powiązania:
    https://bibliotekanauki.pl/articles/1841396.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    scheduling
    maintenance
    genetic algorithm
    branch
    bound
    MILP
    modeling
    optimization
    CPLEX
    Python
    Opis:
    The rapid global economic development of the world economy depends on the availability of substantial energy and resources, which is why in recent years a large share of non-renewable energy resources has attracted interest in energy control. In addition, inappropriate use of energy resources raises the serious problem of inadequate emissions of greenhouse effect gases, with major impact on the environment and climate. On the other hand, it is important to ensure efficient energy consumption in order to stimulate economic development and preserve the environment. As scheduling conflicts in the different workshops are closely associated with energy consumption. However, we find in the literature only a brief work strictly focused on two directions of research: the scheduling with PM and the scheduling with energy. Moreover, our objective is to combine both aspects and directions of in-depth research in a single machine. In this context, this article addresses the problem of integrated scheduling of production, preventive maintenance (PM) and corrective maintenance (CM) jobs in a single machine. The objective of this article is to minimize total energy consumption under the constraints of system robustness and stability. A common model for the integration of preventive maintenance (PM) in production scheduling is proposed, where the sequence of production tasks, as well as the preventive maintenance (PM) periods and the expected times for completion of the tasks are established simultaneously; this makes the theory put into practice more efficient. On the basis of the exact Branch and Bound method integrated on the CPLEX solver and the genetic algorithm (GA) solved in the Python software, the performance of the proposed integer binary mixed programming model is tested and evaluated. Indeed, after numerically experimenting with various parameters of the problem, the B&B algorithm works relatively satisfactorily and provides accurate results compared to the GA algorithm. A comparative study of the results proved that the model developed was sufficiently efficient.
    Źródło:
    Management and Production Engineering Review; 2020, 11, 4; 138-148
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Task allocation algorithms for maximizing reliability of heterogeneous distributed computing systems
    Autorzy:
    Mahmood, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/205582.pdf
    Data publikacji:
    2001
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    heurystyka
    niezawodność
    obliczenie zdecentralizowane
    przetwarzanie rozproszone
    A* algorithm
    branch-and-bound
    distributed computing
    heuristics
    reliability
    task allocation
    Opis:
    The rapid progress of microprocessor and communication technologies has made the distributed computing system economically attractive for many computer applications. One of the first problems encountered in the operation of a distributed system is the problem of allocating the tasks among the processing nodes. The task allocation problem is known to be computationally intractable for large task sets. In this paper, we consider the task allocation problem with the goal of maximizing reliability of heterogeneous distributed systems. After presenting a quantitative task allocation model, we present a least-cost branch-and-bound algorithm to find optimal task allocations. We also present two heuristic algorithms to obtain suboptimal allocations for realistic size large problems in a reasonable amount of computational time. Simulation was used to study the performance of the proposed algorithms for a large number of problems. Also, performance of the proposed algorithms has been compared with a well-known heuristics available in the literature.
    Źródło:
    Control and Cybernetics; 2001, 30, 1; 115-130
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The branch-and-bound method and genetic algorithm in avoidance of ships collisions in fuzzy environment
    Autorzy:
    Mohamed-Seghir, Mostefa
    Powiązania:
    https://bibliotekanauki.pl/articles/259091.pdf
    Data publikacji:
    2012
    Wydawca:
    Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
    Tematy:
    safe ship control
    optimal control
    safe trajectories
    branch and bound method
    genetic algorithm
    ship control
    fuzzy set theory
    Opis:
    Marine navigation consists in continuous observation of the situation at sea, determination the anti-collision manoeuvre. So it necessary to determine ship safe trajectory as a sequence of ship course changing manoeuvres. Each manoeuvre is undertaken on the basis of information obtained from the anti-collision system ARPA. This paper describes a method of safe ship control in the collision situation in a fuzzy environment based on a branch and bound method and a genetic algorithm. The optimal safe ship trajectory in a collision situation is presented as multistage decision-making process.
    Źródło:
    Polish Maritime Research; 2012, S 1; 45-49
    1233-2585
    Pojawia się w:
    Polish Maritime Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-11 z 11

      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