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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 246
Tytuł:
A lower bound on the independence number of a graph in terms of degrees
Autorzy:
Harant, Jochen
Schiermeyer, Ingo
Powiązania:
https://bibliotekanauki.pl/articles/743603.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
independence
stability
algorithm
Opis:
For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.
Źródło:
Discussiones Mathematicae Graph Theory; 2006, 26, 3; 431-437
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Znaczenie algorytmu dydaktycznego w projektowaniu multimedialnych programów dydaktycznych
The importance of the algorithm in the design of multimedia teaching programs
Autorzy:
LIB, Waldemar
Powiązania:
https://bibliotekanauki.pl/articles/456222.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Rzeszowski
Tematy:
algorytm
algorytm dydaktyczny
multimedialny program
algorithm
didactic algorithm
multimedia program
Opis:
Komputerowe programy prezentacyjne oraz łatwe w obsłudze edytory języków programowania stworzyły nauczycielom nieograniczone moŜliwości projektowania i wykonywania własnych opracowań metodycznych opartych na technologiach informatycznych i informacyjnych. Jak wielkie znaczenie cywilizacyjne wywarło upowszechnienie się hiperteksu wyjaśnia szerzej W. Furmanek w opracowaniu Cywilizacyjne i osobowe znaczenie hipertekstu [2008]. W artykule poruszana jest problematyka związana z projektowaniem multimedialnych programów dydaktycznych. To na etapie projektowania podejmowane są decyzje dotyczące struktury programu dydaktycznego, sposobu prezentowania treści kształcenia, ich układu metodycznego, doboru mediów słuŜących do przekazywania i sprawdzania nowo nabytych wiadomości. Często konsekwencją ustalenia struktury multimedialnego programu dydaktycznego i zastosowania określonych mediów jest wybór technologii informatycznych słuŜących do jego realizacji.
Presentation computer programs and easy to use word processors for programming language have offered teachers inexhaustible possibilities of designing and performing their own methodological studies based on information technology. W. Furmanek broadly explains the civilisation significance of popularising a hypertext in the study Civilisation and personal significance of hypertext (2008). The article presents the issues connected with designing multimedia didactic programmes. During the designing stage, there are decisions taken on the structure of a didactic programme, the way of presenting its educational contents, their methodological layout as well as the adjustment of media needed to pass and check newly acquired knowledge. In most cases, the creation of the structure of a multimedia didactic programme and application of specific media relies on the selection of information technologies that allow for its implementation.
Źródło:
Edukacja-Technika-Informatyka; 2012, 3, 2; 173-181
2080-9069
Pojawia się w:
Edukacja-Technika-Informatyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The golden algorithm and the Tower of Babel versus freedom and democracy: the answer to biodiversity
Autorzy:
Flick, Giovanni Maria
Powiązania:
https://bibliotekanauki.pl/articles/28865975.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
algorithm
freedom
democracy
biodiversity
Źródło:
Ruch Prawniczy, Ekonomiczny i Socjologiczny; 2023, 85, 3; 5-12
0035-9629
2543-9170
Pojawia się w:
Ruch Prawniczy, Ekonomiczny i Socjologiczny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of the Apriori algorithm in the management of sports training
Autorzy:
Nawrocka, Monika
Nawrocki, Mateusz
Kostorz, Karolina
Dygacz, Agnieszka
Powiązania:
https://bibliotekanauki.pl/articles/1179490.pdf
Data publikacji:
2017
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
algorithm
management
sports training
Opis:
The objective of the study was to test the Apriori algorithm of classification for obtaining training components that are connected with one another in the strongest way, in athletic training of race walkers. The presented algorithm expansion of the selection process will also generalize and obtain a system for recognizing the effectiveness of athletic training. Furthermore, particular properties of the criteria of component sets will be specified in terms of general selection in order to combine the relative and non-relative criteria.
Źródło:
World Scientific News; 2017, 78; 255-266
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the application of elastic band method to repeatable inverse kinematics in robot manipulators
Autorzy:
Duleba, I.
Opalka, M.
Powiązania:
https://bibliotekanauki.pl/articles/384535.pdf
Data publikacji:
2013
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
inverse kinematics
repeatability
algorithm
Opis:
In this paper an idea of the elastic band method was exploited to design a repeatable inverse kinematics algorithm for robot manipulators. The method incorporates an optimization process at many stages of its performance and admits some extensions. Performance of the algorithm was illustrated on models of the three DOF planar pendulum and the PUMA robot. A comparison with a standard pseudo-inverse Jacobian algorithm, which does not preserve repeatability of inverse kinematics, is also provided.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2013, 7, 4; 5-12
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The concept of using evolutionary algorithms as tools for optimal planning of multimodal composition in the didactic texts
Autorzy:
Jakubowski, M. A.
Charlak, M.
Gryniewicz-Jaworska, M.
Powiązania:
https://bibliotekanauki.pl/articles/102285.pdf
Data publikacji:
2014
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
algorithm
didactic text
connectivism
Opis:
At the beginning we would like to provide a short description of the new theory of learning in the digital age called connectivism. It is the integration of principles explored by the following theories: chaos, network, complexity and self-organization. Next, we describe in short new visual solutions for the teaching of writing so called multimodal literacy 5–11. We define and describe the following notions: multimodal text and original theory so called NOS (non-optimum systems methodology) as a basis for new methods of visual solutions at the classes and audiovisual texts applications. Especially, we would like to emphasize the tremendous usefulness of evolutionary algorithms VEGA and NSGA as tools for optimal planning of multimodal composition in teaching texts. Finally, we give some examples of didactic texts for classrooms, which provide a deep insight into learning skills and tasks needed in the Internet age.
Źródło:
Advances in Science and Technology. Research Journal; 2014, 8, 24; 83-89
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Assembling the SARS-CoV genome - new method based on graph theoretical approach.
Autorzy:
Błażewicz, Jacek
Figlerowicz, Marek
Formanowicz, Piotr
Kasprzak, Marta
Nowierski, Bartosz
Styszyński, Rafał
Szajkowski, Łukasz
Widera, Paweł
Wiktorczyk, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/1041512.pdf
Data publikacji:
2004
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
algorithm
assembling
SARS-CoV
graphs
Opis:
Nowadays, scientists may learn a lot about the organisms studied just by analyzing their genetic material. This requires the development of methods of reading genomes with high accuracy. It has become clear that the knowledge of the changes occuring within a viral genome is indispensable for effective fighting of the pathogen. A good example is SARS-CoV, which was a cause of death of many people and frightened the entire world with its fast and hard to prevent propagation. Rapid development of sequencing methods, like shotgun sequencing or sequencing by hybridization (SBH), gives scientists a good tool for reading genomes. However, since sequencing methods can read fragments of up to 1000 bp only, methods for sequence assembling are required in order to read whole genomes. In this paper a new assembling method, based on graph theoretical approach, is presented. The method was tested on SARS-CoV and the results were compared to the outcome of other widely known methods.
Źródło:
Acta Biochimica Polonica; 2004, 51, 4; 983-993
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New estimate for the curvature of an order-convex set and related questions
Autorzy:
Ramazanov, Ali B.
Powiązania:
https://bibliotekanauki.pl/articles/2050043.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
gradient
estimates
curvature
convexity
algorithm
Opis:
It is well known that in discrete optimization problems, gradient (local) algorithms do not always guarantee an optimal solution. Therefore, the problem arises of finding the accuracy of the gradient algorithm. This is a fairly well-known problem and numerous publications have been devoted to it. In establishing accuracy, various approaches are used. One of these approaches is to obtain guaranteed estimates of the accuracy of the gradient algorithm in terms of the curvature of the admissible domain. With this approach, it is required to find the curvatures of the admissible region. Since finding the exact value of curvature is a difficult problem to solve, curvature estimates in terms of more or less simply calculated parameters of the problem are relevant. A new improved bound for the curvature of an order-convex set is found and is presented in this paper in terms of the steepness and parameters of strict convexity of the function.
Źródło:
Control and Cybernetics; 2020, 49, 2; 233-240
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Conceptual Algorithm of the International Multimodal Transport (CAIMT)
Autorzy:
Miler, Ryszard
Kuriata, Andrzej
Powiązania:
https://bibliotekanauki.pl/articles/504483.pdf
Data publikacji:
2019
Wydawca:
Międzynarodowa Wyższa Szkoła Logistyki i Transportu
Tematy:
algorithm
International Multimodal Transport
containerization
Opis:
The presented paper comes as a summary of a theoretical work presenting an original algorithm describing International Multimodal Transport (IMT) mechanisms and processes. Since containers appeared in early 1960s on the regional, and later on, on global scale in logistic operations, the IMT has become the fastest growing combination of an international through-transport. With use of various modes of transport IMT has significant influence on global trade development. Due to its characteristic the IMT process is exposed on the global unitization, standardization, safety, security and economization (optimization) challenges. Thus, there is a need for scientific approach in building a standardized conceptual model of IMT referred in this paper to CAIMT. CAIMT is an original, deterministic algorithm, presented in the block notation, identifying typical procedures as a logical continuation of the programmed sequence of the basic IMT operations. The suggested CAIMT has a potential in further standardization of IMT procedures and can be scientifically developed through the modeling of the IMT processes and safety/security procedures. In addition, in terms of empirical aspects, algorithmization of the main IMT processes can lead to their application in the various expert systems. Summing up, this method (CAIMT) comes as an optimal instrument that can be utilized in order to build further pillars for IMT development, standardization and optimization.
Źródło:
Logistics and Transport; 2019, 41, 1; 113-128
1734-2015
Pojawia się w:
Logistics and Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algebraic construction of a coboundary of a given cycle
Autorzy:
Mazur, M.
Szybowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/255494.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
algorithm
homology theory
cycle
coboundary
Opis:
We present an algebraic construction of the coboundary of a given cycle as a simpler alternative to the geometric one introduced in [4, 5].
Źródło:
Opuscula Mathematica; 2007, 27, 2; 291-300
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Utrwalanie w nauczaniu historii przy pomocy algorytmu SuperMemo i jemu podobnych – propozycja metody redagowania treści historycznych
Consolidating knowledge in teaching history with the help of the SuperMemo and similar algorithms – a proposed method of editing historical content
Autorzy:
Piotrowski, Mikołaj
Powiązania:
https://bibliotekanauki.pl/articles/2194682.pdf
Data publikacji:
2022-12-30
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
algorithm
history
editing
SuperMemo
consolidation
Opis:
The historical knowledge of Poles, including Polish students, leaves much to be desired, even on a basic level. The insufficient or even the lack of consolidation is the most likely explanation of this phenomenon. The proposed solution to this problem is the SuperMemo and its similar algorithms, along with school history content specially edited for its needs. Basically an algorithm is a set of steps leading to the completion of a task. In the SuperMemo case, the task is to optimize learning, or rather to reduce forgetfulness, while reducing the time devoted to still well-remembered knowledge. Both the SuperMemo and its similar have been implemented in many applications. Quizlet or the software with the same name as the algorithm – SuperMemo, are the examples of such applications. They allow you to learn your own materials as well as those already edited, either by the producer or by other users. The previously edited school historical content for the SuperMemo algorithm and its similar cannot be considered satisfactory if important issues such as: compliance with the core curriculum, division into classes and topics, historical narrative coherence, relationships between pairs of questions and answers, or degrees of difficulty, are regarded. This article proposes a method that can improve this state of affairs. It is the result of theoretical and quasi-experimental work, corrected later on the basis of more serious editorial experience.
Źródło:
Kultura-Społeczeństwo-Edukacja; 2022, 22, 2; 259-273
2300-0422
Pojawia się w:
Kultura-Społeczeństwo-Edukacja
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A collision avoidance algorithm in Simultaneous Localization and Mapping problem for mobile platforms
Autorzy:
Małecki, Tomasz
Narkiewicz, Janusz
Powiązania:
https://bibliotekanauki.pl/articles/2086976.pdf
Data publikacji:
2022
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
algorithm
modeling
path planning
SLAM
Opis:
A collision avoidance algorithm applicable in simultaneous localization and mapping (SLAM) has been developed with a prospect of an on-line application for mobile platforms to search and map the operation area and avoid contact with obstacles. The algorithm, which was implemented in MATLAB software, is based on a linear discrete-time state transition model for determination of the platform position and orientation, and a ‘force’ points method for collision avoidance and definition of the next-step of platform motion. The proposed approach may be incorporated into real-time applications with limited on-board computational resources.
Źródło:
Journal of Theoretical and Applied Mechanics; 2022, 60, 2; 317--328
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithmic aspects of total-subdomination in graphs
Autorzy:
Harris, Laura
Hattingh, Johannes
Henning, Michael
Powiązania:
https://bibliotekanauki.pl/articles/744186.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
total k-subdomination
algorithm
tree
Opis:
Let G = (V,E) be a graph and let k ∈ Z⁺. A total k-subdominating function is a function f: V → {-1,1} such that for at least k vertices v of G, the sum of the function values of f in the open neighborhood of v is positive. The total k-subdomination number of G is the minimum value of f(V) over all total k-subdominating functions f of G where f(V) denotes the sum of the function values assigned to the vertices under f. In this paper, we present a cubic time algorithm to compute the total k-subdomination number of a tree and also show that the associated decision problem is NP-complete for general graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2006, 26, 1; 5-18
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Agglomerations, Relationality, and In-betweenness: Re-learning to Research Agency in Digital Communication
Autorzy:
Kalpokas, Ignas
Powiązania:
https://bibliotekanauki.pl/articles/1112559.pdf
Data publikacji:
2020
Wydawca:
Polskie Towarzystwo Komunikacji Społecznej
Tematy:
agency
posthumanism
technology
agglomeration
anthropocentrism
algorithm
Opis:
As today’s communicative acts are usually irrevocably tied with digital technology, it is important to better understand the resulting ontological and epistemological shifts. The central claim of this article is that humans can no longer be the prime referents of research, either as pure communicators or pure audiences. Instead, research must become sensitive to relational agential flows, whereby different entities interact within ontologically flat agglomerations. For this purpose, the article develops a posthumanist account of the research process that explicitly rejects traditional anthropocentric assumptions in favor of an egalitarian framework that emphasizes relationality and, therefore, constant multidirectional change without linear paths of causation.
Źródło:
Central European Journal of Communication; 2020, 13, 3(27); 426-440
1899-5101
Pojawia się w:
Central European Journal of Communication
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithmic optimization of the calculation with the consideration of the interconnection of the basic economic parameters of the flight route of the model air carrier
Autorzy:
Szabo, Stanislav
Blistanova, Monika
Mako, Sebastian
Vajdova, Iveta
Pilat, Marek
Powiązania:
https://bibliotekanauki.pl/articles/410102.pdf
Data publikacji:
2020
Wydawca:
STE GROUP
Tematy:
algorithm
optimization
economic analysis
load factor
Opis:
The load factor is the determining factor for airlines in economic terms and the prediction of the future development of the flight route. The combination of load factor and break-even point provides the airline with a comprehensive picture of the business of the flight route and the optimization of pricing for the flight route. The purpose of the article is to propose and adapt the development of air transport prices on a given line using maximally recalculated values and maximize profit. The optimized calculation algorithm then facilitates the understanding of the individual steps of the load factor calculation and the monitoring of price development by means of the chi-square mathematical method by which we observed the interconnection of the ticket price and the load factor. To describe the problem, we chose the Bratislava – Larnaca route.
Źródło:
Management Systems in Production Engineering; 2020, 1 (28); 34-39
2299-0461
Pojawia się w:
Management Systems in Production Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 246

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