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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    Tytuł:
    The number of stable matchings in models of the Gale-Shapley type with preferences given by partial orders
    Autorzy:
    Drgas-Burchardt, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/406336.pdf
    Data publikacji:
    2015
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    combinatorial problems
    stable matching
    Gale–Shapley model
    Opis:
    From the famous Gale–Shapley theorem we know that each classical marriage problem admits at least one stable matching. This fact has inspired researchers to search for the maximum number of possible stable matchings, which is equivalent to finding the minimum number of unstable matchings among all such problems of size n. In this paper, we deal with this issue for the Gale–Shapley model with preferences represented by arbitrary partial orders. Also, we discuss this model in the context of the classical Gale–Shapley model.
    Źródło:
    Operations Research and Decisions; 2015, 25, 1; 5-15
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A note on the computation of ordered supported non-dominated solutions in the bi-criteria minimum spanning tree problems
    Autorzy:
    Silva, C. G.
    Cli'maco, J. C. N.
    Powiązania:
    https://bibliotekanauki.pl/articles/308580.pdf
    Data publikacji:
    2007
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    minimum spanning tree
    supported non-dominated solutions
    combinatorial problems
    Opis:
    This paper presents a new procedure for computing the set of supported non dominated solutions of bi-criteria minimum spanning tree problems in ordered manner. The procedure is based on the systematic detection of edges which must be replaced in one efficient solution to obtain the adjacent one, in the criteria space. This new approach avoids solving unnecessary problems and makes use of previous computations.
    Źródło:
    Journal of Telecommunications and Information Technology; 2007, 4; 11-15
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A greedy algorithm for the DNA sequencing by hybridization with positive and negative errors and information about repetitions
    Autorzy:
    Kwarciak, K.
    Formanowicz, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/202322.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    DNA sequencing
    l-mer multiplicity
    greedy algorithm
    combinatorial problems
    Opis:
    In this paper a greedy algorithm for some variants of the sequencing by hybridization method is presented. In the standard version of the method information about repetitions is not available. In the paper it is assumed that a partial information of this type is a part of the problem instance. Here two simple but realistic models of this information are taken into consideration. The first one assumes it is known if a given element of a spectrum appears in the target sequence once or more than once. The second model uses the knowledge is a given element of a spectrum occurs in the analyzed sequence once, twice or at least three times. The proposed greedy algorithm solves the variant of the problem with positive and negative errors. Results of a computational experiment are reported which, among others, confirm that the additional information leads to the improvement of the obtained solutions. They also show that the more precise model of information increases the quality of reconstructed sequences.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2011, 59, 1; 111-115
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Mean Squared Load Criteria for Scheduling Independent Tasks
    Autorzy:
    Dzemyda, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/908277.pdf
    Data publikacji:
    1999
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    przetwarzanie równoległe
    szeregowanie
    zadanie kombinatoryczne
    parallel processing
    scheduling
    combinatorial problems
    minimum makespan problem
    mean squared load
    Opis:
    Results of this paper extend the set of criteria which characterize the scheduling quality as well as the set of possible scheduling strategies. A new view on the minimum makespan criterion is presented in terms of the mean squared load of processing units. This leads in turn to the development of new scheduling algorithms. The interaction between processes of minimizing the new criteria and the maximum finishing time (makespan of the schedule) was discovered. We show the possibility of minimizing the maximum finishing time by minimizing the new criteria that characterize the mean squared load of processing units. Moreover, the optimal workload of processing units determined with the use of the proposed criteria is usually smoother (more balanced) than that found for traditional ones.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 1999, 9, 4; 939-954
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Exponential and chaotic neurodynamical tabu searches for quadratic assignment problems
    Autorzy:
    Hasegawa, M.
    Ikeguchi, T.
    Aihara, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/206864.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    problem optymalizacji kombinatorycznej
    sieć neuronowa
    chaos
    combinatorial optimization problems
    neural networks
    quadratic assignment problems
    tabu search
    Opis:
    We propose a chaotic neurodynamical searching method for the Quadratic Assignment Problems (QAPs). First, we construct a neural network whose behavior is the same as that of the conventional tabu search. Using the dynamics of the tabu search neural network, we realize the exponential tabu search, whose tabu effect decreases exponentially with time, and we show the effectiveness of this type of exponential tabu search. Next, we extend this novel tabu search to a chaotic version. This chaotic method includes both effects of the chaotic dynamical search and the exponential tabu search, and exhibits better performance than the conventional and exponential tabu searches. Last, we propose an automatic parameter tuning method and show that the proposed method exhibits high performance even on large QAPs.
    Źródło:
    Control and Cybernetics; 2000, 29, 3; 773-788
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Inverse problems for distributed parameter systems solved with combinatorial method
    Autorzy:
    Rydygier, E.
    Trzaska, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/206777.pdf
    Data publikacji:
    1999
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    identyfikacja
    metoda kombinatoryczna
    problem przeciwstawny
    combinatorial method
    distributed parameter systems
    field sources identification
    inverse problems
    recurrence equations
    Opis:
    An effective new method for solving inverse problems for 2-D systems is introduced using a modern combinatorial analysis. The combinatorial approach consists in the use of new computational tools constructed by authors of this paper during previous investigations in a field of combinatorics and the Fibonacci trigonometry. The formulation of numerical algorithms for solving direct and inverse problems of the 2-D systems is presented with special regard to identification problems. Also possible fields of application in technology and industry are indicated. Advantages of presented method are indicated. These are simplicity of calculations based on recurrence equations defining monic polynomials, high accuracy of calculations, and ease to implement it in the MATLAB language.
    Źródło:
    Control and Cybernetics; 1999, 28, 2; 237-258
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    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