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-5 z 5
    Tytuł:
    Integrating pivot based search with branch and bound for binary MIPs
    Autorzy:
    Lokketangen, A.
    Woodruff, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/206756.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    branch and bound
    chunking
    heuristics
    tabu search
    Opis:
    This paper examines integration of a sophisticated, pivot-based tabu search into branch and bound for 0-1 MIPS and global diversification tests using chunking. Issues related to behavior of a tabu search within a branch and bound algorithm are analyzed using computational experiments. Results are presented showing that the inclusion of the local search sometimes results in fewer and nodes and lower CPU times even when used in a callback mode. The main benefit in incorporating a pivot based heuristic is that an integer feasible solution can be found earlier in the branching process. Computational experiments are presented showing that for some instances the overall search time is improved, while for some others the tabu search can find good solutions quickly.
    Źródło:
    Control and Cybernetics; 2000, 29, 3; 741-759
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On probabilistic bounds inspired by interval arithmetic
    Autorzy:
    Zilinskas, A.
    Zilinskas, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/969846.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    global optimization
    branch and bound method
    randomized computing
    interval arithmetic
    Opis:
    A randomized method aimed at evaluation of probabilistic bounds for function values is considered. Stochastic intervals tightly covering ranges of function values with probability close to one are modelled by a randomized method inspired by interval arithmetic. Statistical properties of the modelled intervals are investigated experimentally. The experimental results are discussed with respect to application of this method in the construction of a branch and bound type randomized algorithm for global optimization.
    Źródło:
    Control and Cybernetics; 2010, 39, 2; 507-525
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Scatter Search based algorithms for min-max regret task scheduling problems with interval uncertainty
    Autorzy:
    Józefczyk, J.
    Siepak, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/206069.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    task scheduling
    interval uncertainty
    min-max regret
    branch and bound
    Opis:
    Uncertain versions of three task scheduling problems: P║Cmax, F2║Cmax, R║Σ Cj are investigated. Parametric uncertainty is only considered which is represented by intervals. It is assumed that values of execution times of tasks are not a priori given, and they belong to the intervals of known bounds. No distributions additionally characterizing the uncertain parameters are assumed. The regret is used as the basis for a criterion evaluating the uncertainty. In a consequence, min-max regret combinatorial problems are solved. Heuristic algorithms based on Scatter Search are proposed. They are evaluated via computational experiments and compared to a simple middle intervals heuristics and to exact solutions for small instances of the problems considered.
    Źródło:
    Control and Cybernetics; 2013, 42, 3; 667-698
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Target assignment problem for air raid
    Autorzy:
    Chudy, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/205571.pdf
    Data publikacji:
    1999
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    problem przyporządkowania adresów
    air raid planning
    assignment problem
    branch-and-bound method
    Opis:
    The article deals with two formulations of the target assignment problem. The first one concerns a homogeneous collection of air raid means (different types of aircrafts and missiles). We propose a method for solving a subclass of the problem. The approach consists of two parts. First, an equivalent assignment-type problem is constructed, then a modified branch-and-bound method is used to solve the problem. The other formulation concerns a heterogencous collection of means. To describe this problem a new algebra is introduced
    Źródło:
    Control and Cybernetics; 1999, 28, 1; 101-113
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    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ł
      Wyświetlanie 1-5 z 5

      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