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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-10 z 10
    Tytuł:
    Canonical greedy algorithms and dynamic programming
    Autorzy:
    Lew, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/970856.pdf
    Data publikacji:
    2006
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    programowanie dynamiczne
    Dijkstra
    greedy algorithm
    dynamic programming
    Opis:
    There has been little work on how to construct greedy algorithms to solve new optimization problems efficiently. Instead, greedy algorithms have generally been designed on an ad hoc basis. On the other hand, dynamic programming has a long history of being a useful tool for solving optimization problems, but is often inefficient. We show how dynamic programming can be used to derive efficient greedy algorithms that are optimal for a wide variety of problems. This approach also provides a way to obtain less efficient but optimal solutions to problems where derived greedy algorithms are nonoptimal.
    Źródło:
    Control and Cybernetics; 2006, 35, 3; 621-643
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Neonatal Mortality by Gestational Age and Birth Weight in Italy, 1998-2003: A Record Linkage Study
    Autorzy:
    Marini, Cristiano
    Nuccitelli, Alessandra
    Powiązania:
    https://bibliotekanauki.pl/articles/465989.pdf
    Data publikacji:
    2011
    Wydawca:
    Główny Urząd Statystyczny
    Tematy:
    administrative data
    Boolean linear programming
    data quality
    greedy algorithm
    Opis:
    Neonatal mortality rates by gestational age and birth weight category are important indicators of maternal and child health and care quality. However, due to recent laws on administrative simplification and privacy, these specific rates have not been calculated in Italy since 1999. The main aim of this work is to assess the possibility of retrieving information on neonatal mortality by the linkage between records related to live births and records related to infant deaths within the first month of life, with reference to 2003 and 2004 birth cohorts. From a strict methodological point of view, some critical aspects of the most used record linkage approach are highlighted: specific problems may arise from the choice of records to be linked if there are consistency constraints between pairs (in this context, one death record can be linked to at most one birth record). In the light of considerations on the quality of the starting data, the retrieval of information on neonatal mortality by gestational age and birth weight is restricted to Northern Italy. Specific neonatal mortality rates are provided with reference to 2003 and discussed with particular emphasis on quality issues in the data collection processes.
    Źródło:
    Statistics in Transition new series; 2011, 12, 1; 207-222
    1234-7655
    Pojawia się w:
    Statistics in Transition new series
    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ł:
    A Minimum-Spanning-Tree-Inspired Algorithm for Channel Assignment in 802.11 Networks
    Autorzy:
    Dolińska, I.
    Jakubowski, M.
    Masiukiewicz, A.
    Rządkowski, G.
    Piórczyński, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/226434.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    channel selection
    channel assignment
    802.11 home networks
    greedy algorithm
    Opis:
    Channel assignment in 2.4 GHz band of 802.11 standard is still important issue as a lot of 2.4 GHz devices are in use. This band offers only three non-overlapping channels, so in crowded environment users can suffer from high interference level. In this paper, a greedy algorithm inspired by the Prim’s algorithm for finding minimum spanning trees (MSTs) in undirected graphs is considered for channel assignment in this type of networks. The proposed solution tested for example network distributions achieves results close to the exhaustive approach and is, in many cases, several orders of magnitude faster.
    Źródło:
    International Journal of Electronics and Telecommunications; 2016, 62, 4; 379-388
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Meta-heuristic approach based on genetic and greedy algorithms to solve flexible job-shop scheduling problem
    Autorzy:
    Rezaeipanah, Amin
    Sarhangnia, Fariba
    Abdollahi, Mohammad Javad
    Powiązania:
    https://bibliotekanauki.pl/articles/2097966.pdf
    Data publikacji:
    2021
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    job-shop scheduling
    meta-heuristic method
    genetic algorithm
    greedy algorithm
    jobs priority
    Opis:
    Job-shop scheduling systems are one of the applications of group technology in industry, the purpose of which is to take advantage of the physical or operational similarities of products in their various aspects of construction and design. Additionally, these systems are identified as cellular manufacturing systems (CMS). In this paper, a meta-heuristic method that is based on combining genetic and greedy algorithms has been used in order to optimize and evaluate the performance criteria of the flexible job-shop scheduling problem. In order to improve the efficiency of the genetic algorithm, the initial population is generated by the greedy algorithm, and several elitist operators are used to improve the solutions. The greedy algorithm that is used to improve the generation of the initial population prioritizes the cells and the job in each cell and, thus, offers quality solutions. The proposed algorithm is tested over the P-FJSP dataset and compared with the state-of-the-art techniques of this literature. To evaluate the performance of the diversity, spacing, quality, and run-time criteria were used in a multi-objective function. The results of the simulation indicate the better performance of the proposed method as compared to the NRGA and NSGA-II methods.
    Źródło:
    Computer Science; 2021, 22 (4); 463--488
    1508-2806
    2300-7036
    Pojawia się w:
    Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Dijkstras algorithm revisited: the dynamic programming connexion
    Autorzy:
    Sniedovich, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/970872.pdf
    Data publikacji:
    2006
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    programowanie dynamiczne
    badania operacyjne
    Dijkstra's algorithm
    dynamic programming
    greedy algorithm
    principle of optimality
    successive approximation
    operations research
    computer science
    Opis:
    Dijkstra's Algorithm is one of the most popular algorithms in computer science. It is also popular in operations research. It is generally viewed and presented as a greedy algorithm. In this paper we attempt to change this perception by providing a dynamic programming perspective on the algorithm. In particular, we are reminded that this famous algorithm is strongly inspired by Bellman's Principle of Optimality and that both conceptually and technically it constitutes a dynamic programming successive approximation procedure par excellence. One of the immediate implications of this perspective is that this popular algorithm can be incorporated in the dynamic programming syllabus and in turn dynamic programming should be (at least) alluded to in a proper exposition/teaching of the algorithm.
    Źródło:
    Control and Cybernetics; 2006, 35, 3; 599-620
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Research on optimization of unrelated parallel machine scheduling based on IG-TS algorithm
    Autorzy:
    Chi, Xinfu
    Liu, Shijing
    Li, Ce
    Powiązania:
    https://bibliotekanauki.pl/articles/2173693.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    warp knitting machine
    parallel machine scheduling
    iterative greedy algorithm
    tabu search
    osnowarka
    planowanie maszyn równoległych
    algorytm zachłanny iteracyjny
    przeszukiwanie tabu
    Opis:
    This issue is a typical NP-hard problem for an unrelated parallel machine scheduling problem with makespan minimization as the goal and no sequence-related preparation time. Based on the idea of tabu search (TS), this paper improves the iterative greedy algorithm (IG) and proposes an IG-TS algorithm with deconstruction, reconstruction, and neighborhood search operations as the main optimization process. This algorithm has the characteristics of the strong capability of global search and fast speed of convergence. The warp knitting workshop scheduling problem in the textile industry, which has the complex characteristics of a large scale, nonlinearity, uncertainty, and strong coupling, is a typical unrelated parallel machine scheduling problem. The IG-TS algorithm is applied to solve it, and three commonly used scheduling algorithms are set as a comparison, namely the GA-TS algorithm, ABC-TS algorithm, and PSO-TS algorithm. The outcome shows that the scheduling results of the IG-TS algorithm have the shortest manufacturing time and good robustness. In addition, the production comparison between the IG-TS algorithm scheduling scheme and the artificial experience scheduling scheme for the small-scale example problem shows that the IG-TS algorithm scheduling is slightly superior to the artificial experience scheduling in both planning and actual production. Experiments show that the IG-TS algorithm is feasible in warp knitting workshop scheduling problems, effectively realizing the reduction of energy and the increase in efficiency of a digital workshop in the textile industry.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 4; art. no. e141724
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Interfejs do zdalnego sterowania ploterem z funkcją rozpoznawania obrazów
    Interface for remote control of the plotter with image recognition function
    Autorzy:
    Kamiński, M.
    Morawiec, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/266390.pdf
    Data publikacji:
    2017
    Wydawca:
    Politechnika Gdańska. Wydział Elektrotechniki i Automatyki
    Tematy:
    CNC
    silnik krokowy
    ploter
    problem komiwojażera
    algorytm wspinaczkowy
    algorytm symulowanego wyżarzania
    algorytm genetyczny
    algorytm zachłanny
    przetwarzanie obrazów
    Arduino
    GRBL
    OpenCV
    Bluetooth
    Android
    stepper motor
    plotter
    travelling salesman problem
    hill climbing algorithm
    simulated annealing algorithm
    genetics algorithm
    greedy algorithm
    image processing
    Opis:
    Maszyny numeryczne takie jak obrabiarki CNC, plotery czy drukarki 3D są coraz powszechniejsze w użytku. Na Politechnice Gdańskiej przygotowano pracę magisterską [12], której rezultaty przedstawiono w niniejszym artykule. Ze względu na objętość referatu, przedstawiono jedynie wybrane aspekty budowy plotera, aplikacji na urządzenie mobilne oraz przegląd zastosowanych algorytmów optymalizacji pod kątem szybkości rysowania. Aplikacja funkcjonuje w systemie Android, a komunikuje się z maszyną za pomocą interfejsu bluetooth. Aplikacja oferuje także możliwość optymalizacji tras, zarówno tych rysowanych, jak i nierysowanych, pokonywanych przez ploter. Jest to problem komiwojażera bez powrotu, który rozwiązany może być poprzez algorytmy: zachłanny, genetyczny, wspinaczkowy lub symulowanego wyżarzania.
    The topic is to build a CNC machine working as a plotter, and also create an application running on the Android operating system, which processes images, optimizes the code and allows to control the built machine. The examination is an estimation which of the methods used in this thesis is optimal and gives the best results in this type of problem, which is choosing the shortest path of the salesman problem. The purpose of the paper is to obtain the code processed by the numerical machine in the shortest possible time, which will be carried out in a short period of time with the proper accuracy of the work. Another important aspect is the implementation of an intuitive user interface that does not cause problems with support. The optimization methods used produce satisfactory results that are more or less practical depending on the problem. The effect in the form of drawn images is at a high level of accuracy. After many hours of working with the CNC machine using the created application, it can be seen that this is a useful set for both people who want to create their own images as well as for those seeking education in this field. The great advantage is that the design is very easily expandable so that it can acquire new, very useful features for a small amount of extra work in the form of adding new functionality.
    Źródło:
    Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej; 2017, 57; 37-42
    1425-5766
    2353-1290
    Pojawia się w:
    Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Construction of Variable Strength Covering Array for Combinatorial Testing Using a Greedy Approach to Genetic Algorithm
    Autorzy:
    Bansal, P
    Sabharwal, S
    Mittal, N
    Arora, S
    Powiązania:
    https://bibliotekanauki.pl/articles/384137.pdf
    Data publikacji:
    2015
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    combinatorial testing
    variable strength covering array
    genetic algorithm
    greedy approach
    Opis:
    The limitation of time and budget usually prohibits exhaustive testing of interactions between components in a component based software system. Combinatorial testing is a software testing technique that can be used to detect faults in a component based software system caused by the interactions of components in an effective and efficient way. Most of the research in the field of combinatorial testing till now has focused on the construction of optimal covering array (CA) of fixed strength t which covers all t-way interactions among components. The size of CA increases with the increase in strength of testing t, which further increases the cost of testing. However, not all components require higher strength interaction testing. Hence, in a system with k components a technique is required to construct CA of fixed strength t which covers all t-way interactions among k components and all ti-way (where ti > t) interactions between a subset of k components. This is achieved using the variable strength covering array (VSCA). In this paper we propose a greedy based genetic algorithm (GA) to generate optimal VSCA. Experiments are conducted on several benchmark configurations to evaluate the effectiveness of the proposed approach.
    Źródło:
    e-Informatica Software Engineering Journal; 2015, 9, 1; 87-105
    1897-7979
    Pojawia się w:
    e-Informatica Software Engineering Journal
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Multi-sourced power system restoration strategy based on modified Prim’s algorithm
    Autorzy:
    Łukaszewski, Artur
    Nogal, Łukasz
    Powiązania:
    https://bibliotekanauki.pl/articles/2086893.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    self-healing grid
    micro-grid
    reconfiguration
    greedy algorithms
    graph theory
    simulations
    Prim’s algorithm
    siatka samoleczenia
    mikrosiatka
    rekonfiguracja
    algorytmy zachłanne
    teoria grafów
    symulacje
    algorytm Prima
    Opis:
    Self-healing grids are one of the most developing concepts applied in electrical engineering. Each restoration strategy requires advanced algorithms responsible for the creation of local power systems. Multi-agent automation solutions dedicated for smart grids are mostly based on Prim’s algorithm. Graph theory in that field also leaves many problems unsolved. This paper is focused on a variation of Prim’s algorithm utility for a multi-sourced power system topology. The logic described in the paper is a novel concept combined with a proposal of a multi-parametrized weight calculation formula representing transmission features of energy delivered to loads present in a considered grid. The weight is expressed as the combination of three elements: real power, reactive power, and real power losses. The proposal of a novel algorithm was verified in a simulation model of a power system. The new restoration logic was compared with the proposal of the strategy presented in other recently published articles. The novel concept of restoration strategy dedicated to multi-sourced power systems was verified positively by simulations. The proposed solution proved its usefulness and applicability.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 5; e137942, 1--12
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-10 z 10

      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