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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    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ł:
    Control flow graphs and code coverage
    Autorzy:
    Gold, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/908136.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    graf skierowany
    graf przepływowy
    testowanie oprogramowania
    directed graph
    control flow graph
    graph reduction
    software testing
    statement coverage
    branch coverage
    Opis:
    The control flow of programs can be represented by directed graphs. In this paper we provide a uniform and detailed formal basis for control flow graphs combining known definitions and results with new aspects. Two graph reductions are defined using only syntactical information about the graphs, but no semantical information about the represented programs. We prove some properties of reduced graphs and also about the paths in reduced graphs. Based on graphs, we define statement coverage and branch coverage such that coverage notions correspond to node coverage, and edge coverage, respectively.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2010, 20, 4; 739-749
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    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ł:
    Accelerating backtrack search with a best-first-search strategy
    Autorzy:
    Mann, Z. Á.
    Szép, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/329816.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    best first search
    backtrack
    branch and bound
    constraint satisfaction problem (CSP)
    frequent restarting
    algorytm wyszukiwania
    system backtrack
    metoda podziału i ograniczeń
    programowanie z ograniczeniami
    Opis:
    Backtrack-style exhaustive search algorithms for NP-hard problems tend to have large variance in their runtime. This is because “fortunate” branching decisions can lead to finding a solution quickly, whereas “unfortunate” decisions in another run can lead the algorithm to a region of the search space with no solutions. In the literature, frequent restarting has been suggested as a means to overcome this problem. In this paper, we propose a more sophisticated approach: a best-first-search heuristic to quickly move between parts of the search space, always concentrating on the most promising region. We describe how this idea can be efficiently incorporated into a backtrack search algorithm, without sacrificing optimality. Moreover, we demonstrate empirically that, for hard solvable problem instances, the new approach provides significantly higher speed-up than frequent restarting.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 901-916
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    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ł:
    Configuring a sensor network for fault detection in distributed parameter systems
    Autorzy:
    Patan, M.
    Uciński, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/929887.pdf
    Data publikacji:
    2008
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    metoda podziału i ograniczeń
    ograniczony plan eksperymentu
    układ o parametrach rozłożonych
    detekcja uszkodzeń
    estymacja parametryczna
    rozmieszczanie czujników
    branch-and-bound
    constrained experimental design
    distributed parameter system
    fault detection
    parameter estimation
    sensor location
    Opis:
    The problem of fault detection in distributed parameter systems (DPSs) is formulated as that of maximizing the power of a parametric hypothesis test which checks whether or not system parameters have nominal values. A computational scheme is provided for the design of a network of observation locations in a spatial domain that are supposed to be used while detecting changes in the underlying parameters of a distributed parameter system. The setting considered relates to a situation where from among a finite set of potential sensor locations only a subset can be selected because of the cost constraints. As a suitable performance measure, the Ds-optimality criterion defined on the Fisher information matrix for the estimated parameters is applied. Then, the solution of a resulting combinatorial problem is determined based on the branch-and-bound method. As its essential part, a relaxed problem is discussed in which the sensor locations are given a priori and the aim is to determine the associated weights, which quantify the contributions of individual gauged sites. The concavity and differentiability properties of the criterion are established and a gradient projection algorithm is proposed to perform the search for the optimal solution. The delineated approach is illustrated by a numerical example on a sensor network design for a two-dimensional convective diffusion process.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2008, 18, 4; 513-524
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-6 z 6

      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