Thematische Bibliographien / Algorithmic structures

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte
  6. Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Algorithmic structures“

Autor: Grafiati
Veröffentlicht am 28. Juni 2021
Zuletzt aktualisiert am 29. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Algorithmic structures" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Algorithmic structures"

1

Esponda-Argüero, Margarita. "Techniques for Visualizing Data Structures in Algorithmic Animations." Information Visualization 9, no. 1 (2009): 31–46. http://dx.doi.org/10.1057/ivs.2008.26.

Der volle Inhalt der Quelle
Annotation:
This paper deals with techniques for the design and production of appealing algorithmic animations and their use in computer science education. A good visual animation is both a technical artifact and a work of art that can greatly enhance the understanding of an algorithm's workings. In the first part of the paper, I show that awareness of the composition principles used by other animators and visual artists can help programmers to create better algorithmic animations. The second part shows how to incorporate those ideas in novel animation systems, which represent data structures in a visuall
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Valencia, Carlos E., and Ralihe R. Villagrán. "Algorithmic aspects of arithmetical structures." Linear Algebra and its Applications 640 (May 2022): 191–208. http://dx.doi.org/10.1016/j.laa.2022.01.020.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Kalimullin, I. "Algorithmic reducibilities of algebraic structures." Journal of Logic and Computation 22, no. 4 (2010): 831–43. http://dx.doi.org/10.1093/logcom/exq046.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Zhu, Guo Jin, Kai Zhang, and Ji Yun Li. "Discovering Algorithmic Relationship between Programming Resources on the Web." Applied Mechanics and Materials 347-350 (August 2013): 2430–35. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2430.

Der volle Inhalt der Quelle
Annotation:
Algorithmic relationships are discovered here for programming tutoring. There are two kinds of algorithmic relationships between programming resources on the web: associative relationship and structural similarity relationship. They can be organized as a hierarchical body. An algorithm can solve different programming problems and a programming problem also can be solved by different algorithms. Thus, there is such algorithmic relationship, or associative relationship, between these programming resources on the web. The algorithmic structures of source codes can be mined by neural computing. Di
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Cohn, H., and A. Kumar. "Algorithmic design of self-assembling structures." Proceedings of the National Academy of Sciences 106, no. 24 (2009): 9570–75. http://dx.doi.org/10.1073/pnas.0901636106.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Sanchez-Cartas, J. Manuel, and Evangelos Katsamakas. "Artificial Intelligence, Algorithmic Competition and Market Structures." IEEE Access 10 (2022): 10575–84. http://dx.doi.org/10.1109/access.2022.3144390.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Ratsaby, Joel, and J. Chaskalovic. "On the algorithmic complexity of static structures." Journal of Systems Science and Complexity 23, no. 6 (2010): 1037–53. http://dx.doi.org/10.1007/s11424-010-8465-2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Banaru, D. A., and S. M. Aksenov. "Combinatorial and algorithmic complexity of crystal structures." LITHOSPHERE (Russia) 24, no. 2 (2024): 240–53. http://dx.doi.org/10.24930/1681-9004-2024-24-2-240-253.

Der volle Inhalt der Quelle
Annotation:
Research subject. Numeral indexes describing the complexity of the system of contacts between structural units in crystal structures. Aim. Development of a complexity index for the system of contacts between periodic structural units based on the indices available for those between structural units in island (molecular) structures. Materials and methods. Structural data were selected from the COD, AMCSD, and CSD crystallographic databases. The system of contacts in the structures was analyzed by the Voronoi–Dirichlet polyhedra (VDP) method in the ToposPro software package. Results. The method
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Behnam Shad, Klaus. "Algorithmic Hegemony." Journal of Sociocybernetics 20, no. 1 (2025): 13–41. https://doi.org/10.26754/ojs_jos/jos.2025111599.

Der volle Inhalt der Quelle
Annotation:
This article examines the transformative role of AI-mediated communication systems (AIMCS) in shaping public discourse and political outcomes, with a specific focus on the 2025 German electoral campaign. By integrating insights from sociocybernetics, neurobiology, and anthropology, this study offers a multidisciplinary analysis of how AIMCS have evolved from passive conduits of information into active agents of governance. The article investigates how advanced generative models and engagement-driven algorithms restructure political communication by embedding hegemonic power structures into dig
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Sui, Yining. "Research on the Algorithmic Structures in Artificial Intelligence." Applied and Computational Engineering 97, no. 1 (2024): 157–62. http://dx.doi.org/10.54254/2755-2721/97/20241271.

Der volle Inhalt der Quelle
Annotation:
Abstract. In recent years, artificial intelligence (AI) has experienced remarkable growth, largely driven by significant advancements in algorithm structures. This paper provides a comprehensive review of the key algorithmic frameworks employed in AI, with a primary focus on traditional algorithms and their evolution in response to modern deep learning techniques. Traditional algorithms, such as decision trees, support vector machines, and genetic algorithms, have long served as foundational pillars in AI research. However, the advent of deep learning has introduced new paradigms that signific
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Dissertationen zum Thema "Algorithmic structures"

1

Li, Quan Ph D. Massachusetts Institute of Technology. "Algorithms and algorithmic obstacles for probabilistic combinatorial structures." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/115765.

Der volle Inhalt der Quelle
Annotation:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 209-214).<br>We study efficient average-case (approximation) algorithms for combinatorial optimization problems, as well as explore the algorithmic obstacles for a variety of discrete optimization problems arising in the theory of random graphs, statistics and machine learning. In particular, we consider the average-case optimization for three NP-hard combinatorial optimization problems: La
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Vialette, Stéphane. "Algorithmic Contributions to Computational Molecular Biology." Habilitation à diriger des recherches, Université Paris-Est, 2010. http://tel.archives-ouvertes.fr/tel-00862069.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

King, Stephen. "Higher-level algorithmic structures in the refinement calculus." Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300129.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Hashemolhosseini, Sepehr. "Algorithmic component and system reliability analysis of truss structures." Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/85710.

Der volle Inhalt der Quelle
Annotation:
Thesis (MScEng)-- Stellenbosch University, 2013.<br>ENGLISH ABSTRACT: Most of the parameters involved in the design and analysis of structures are of stochastic nature. This is, therefore, of paramount importance to be able to perform a fully stochastic analysis of structures both in component and system level to take into account the uncertainties involved in structural analysis and design. To the contrary, in practice, the (computerised) analysis of structures is based on a deterministic analysis which fails to address the randomness of design and analysis parameters. This means that an
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Breuils, Stéphane. "Structures algorithmiques pour les opérateurs d'algèbre géométrique et application aux surfaces quadriques." Thesis, Paris Est, 2018. http://www.theses.fr/2018PESC1142/document.

Der volle Inhalt der Quelle
Annotation:
L'algèbre géométrique est un outil permettant de représenter et manipuler les objets géométriques de manière générique, efficace et intuitive. A titre d'exemple, l'Algèbre Géométrique Conforme (CGA), permet de représenter des cercles, des sphères, des plans et des droites comme des objets algébriques. Les intersections entre ces objets sont incluses dans la même algèbre. Il est possible d'exprimer et de traiter des objets géométriques plus complexes comme des coniques, des surfaces quadriques en utilisant une extension de CGA. Cependant due à leur représentation requérant un espace vectoriel d
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Raymond, Jean-Florent. "Structural and algorithmic aspects of partial orderings of graphs." Thesis, Montpellier, 2016. http://www.theses.fr/2016MONTT289.

Der volle Inhalt der Quelle
Annotation:
Le thème central à cette thèse est l'étude des propriétés des classes de graphes définies par sous-structures interdites et leurs applications.La première direction que nous suivons a trait aux beaux ordres. À l'aide de théorèmes de décomposition dans les classes de graphes interdisant une sous-structure, nous identifions celles qui sont bellement-ordonnées. Les ordres et sous-structures considérés sont ceux associés aux notions de contraction et mineur induit. Ensuite, toujours en considérant des classes de graphes définies par sous-structures interdites, nous obtenons des bornes sur des inva
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Bessy, Stéphane. "Some problems in graph theory and graphs algorithmic theory." Habilitation à diriger des recherches, Université Montpellier II - Sciences et Techniques du Languedoc, 2012. http://tel.archives-ouvertes.fr/tel-00806716.

Der volle Inhalt der Quelle
Annotation:
This document is a long abstract of my research work, concerning graph theory and algorithms on graphs. It summarizes some results, gives ideas of the proof for some of them and presents the context of the different topics together with some interesting open questions connected to them The first part precises the notations used in the rest of the paper; the second part deals with some problems on cycles in digraphs; the third part is an overview of two graph coloring problems and one problem on structures in colored graphs; finally the fourth part focus on some results in algorithmic graph the
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Mohan, Rathish. "Algorithmic Optimization of Sensor Placement on Civil Structures for Fault Detection and Isolation." University of Cincinnati / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1353156107.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Ballage, Marion. "Algorithmes de résolution rapide de problèmes mécaniques sur GPU." Thesis, Toulouse 3, 2017. http://www.theses.fr/2017TOU30122/document.

Der volle Inhalt der Quelle
Annotation:
Dans le contexte de l'analyse numérique en calcul de structures, la génération de maillages conformes sur des modèles à géométrie complexe conduit à des tailles de modèles importantes, et amène à imaginer de nouvelles approches éléments finis. Le temps de génération d'un maillage est directement lié à la complexité de la géométrie, augmentant ainsi considérablement le temps de calcul global. Les processeurs graphiques (GPU) offrent de nouvelles opportunités pour le calcul en temps réel. L'architecture grille des GPU a été utilisée afin d'implémenter une méthode éléments finis sur maillage cart
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Bricage, Marie. "Modélisation et Algorithmique de graphes pour la construction de structures moléculaires." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLV031/document.

Der volle Inhalt der Quelle
Annotation:
Dans cette thèse, nous présentons une approche algorithmique permettant la génération de guides de construction de cages moléculaires organiques. Il s'agit d'architectures semi-moléculaires possédant un espace interne défini capable de piéger une molécule cible appelée substrat. De nombreuses œuvres proposent de générer des cages organiques moléculaires obtenues à partir de structures symétriques, qui ont une bonne complexité, mais elles ne sont pas spécifiques car elles ne prennent pas en compte des cibles précises. L'approche proposée permet de générer des guides de construction de cages mol
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Bücher zum Thema "Algorithmic structures"

1

Hajnicz, Elżbieta. Time structures: Formal description and algorithmic representation. Springer, 1996.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Engeler, Erwin. Algorithmic properties of structures: Selected papers of E. Engeler. World Scientific, 1993.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Jean-Paul, Tremblay. An introduction to computer science: An algorithmic approach. McGraw-Hill, 1989.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Atallah, Mikhail. Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011. Proceedings. Springer Berlin Heidelberg, 2011.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Fellows, Michael. Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings. Springer Berlin Heidelberg, 2013.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Workshop, WADS '89 (1989 Ottawa Ont ). Algorithms and data structures: Workshop WADS '89, Ottawa, Canada, August 17-19, 1989 : proceedings. Springer-Verlag, 1989.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Gdanskiy, Nikolay. Fundamentals of the theory and algorithms on graphs. INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/978686.

Der volle Inhalt der Quelle
Annotation:
The textbook describes the main theoretical principles of graph theory, the main tasks to be solved using graph structures, and General methods of their solution and specific algorithms, with estimates of their complexity. I covered a lot of the examples given questions to test knowledge and tasks for independent decisions. Along with the control tasks to verify the theoretical training provided practical assignments to develop programs to study topics of graph theory.&#x0D; Meets the requirements of Federal state educational standards of higher education of the last generation.&#x0D; Designed
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

AAIM 2010 (2010 Weihai, China). Algorithmic aspects in information and management: 6th international conference, AAIM 2010, Weihai, China, July 19-21, 2010 : proceedings. Springer, 2010.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Brunskill, David. Understanding algorithms and data structures. McGraw-Hill, 1996.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Weiss, Mark Allen. Data structures and algorithm analysis. Benjamin/Cummings Pub. Co., 1992.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Buchteile zum Thema "Algorithmic structures"

1

Mahout, Vincent. "Algorithmic and Data Structures." In Assembly Language Programming. John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118562123.ch6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Artut, Selçuk. "Algorithmic Structures in Art." In Geometric Patterns with Creative Coding. Apress, 2023. http://dx.doi.org/10.1007/978-1-4842-9389-8_2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Möller, Bernhard. "Calculating With Pointer Structures." In Algorithmic Languages and Calculi. Springer US, 1997. http://dx.doi.org/10.1007/978-0-387-35264-0_2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Bartsch, Katharina. "Demonstration of algorithmic support structures." In Digitalization of design for support structures in laser powder bed fusion of metals. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-22956-5_8.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Kaczmarek, Joanna, and Jörg Rothe. "Manipulation in Communication Structures of Graph-Restricted Weighted Voting Games." In Algorithmic Decision Theory. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-87756-9_13.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Novosád, Tomá, Václav Snáel, Ajith Abraham, and Jack Y. Yang. "Discovering 3D Protein Structures for Optimal Structure Alignment." In Algorithmic and Artificial Intelligence Methods for Protein Bioinformatics. John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118567869.ch14.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Chen, Danny Z., and Ewa Misiołek. "Algorithms for Interval Structures with Applications." In Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21204-8_23.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Friedler, Ferenc, Ákos Orosz, and Jean Pimentel Losada. "Algorithmic Generation of all Solution-Structures." In P-graphs for Process Systems Engineering. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-92216-0_5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Xu, Jin. "DNA Algorithmic Self-Assembly." In Biological Computing. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-3870-3_10.

Der volle Inhalt der Quelle
Annotation:
Abstract Since Seeman proposed using DNA as a nanomaterial, DNA Tile and DNA origami technologies have been successively proposed, and DNA has realized the programmable assembly from two-dimensional patterns to three-dimensional spatial structures. The nanostructures constructed by DNA have stable properties, regular geometric appearance, and spatial addressability, and are widely used in many fields. DNA algorithmic self-assembly can be realized by controlling the self-assembly process in ways such as sequence and connection rules. With the programmability of DNA sequences, the design of DNA
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Nievergelt, Jürg, and Peter Widmayer. "Spatial data structures: Concepts and design choices." In Algorithmic Foundations of Geographic Information Systems. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63818-0_6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Algorithmic structures"

1

Rao, Lade Gunakar, Erupaka Nitya, Jyoshna Devi Kusumba, K. Rajchandar, and S. Narasimha Murthy. "“Optimizing Algorithmic Efficiency: Exploring Advanced Data Structures for High-Performance Computing”." In 2024 3rd International Conference on Computational Modelling, Simulation and Optimization (ICCMSO). IEEE, 2024. http://dx.doi.org/10.1109/iccmso61761.2024.00019.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

K, Venugopal, Anagha Muralidharan, Cherishma Kumar Subhasa, Nishanth Sarode, and Pranay Prasad. "Quantum Algorithmic Approaches to Protein Folding: A Comprehensive Study of Diverse Lattice Structures." In 2024 8th International Conference on Computational System and Information Technology for Sustainable Solutions (CSITSS). IEEE, 2024. https://doi.org/10.1109/csitss64042.2024.10816928.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Luczkowski, Marcin, Hanne Seeberg, Anders Rønnquist, Rakel Gundersen, and Sofie Dahl-Nielsen. "Application of Reclaimed Elements in Structural Engineering Towards Circular Economy." In IABSE Symposium, Tokyo 2025: Environmentally Friendly Technologies and Structures: Focusing on Sustainable Approaches. International Association for Bridge and Structural Engineering (IABSE), 2025. https://doi.org/10.2749/tokyo.2025.0189.

Der volle Inhalt der Quelle
Annotation:
&lt;p&gt;The reuse of reclaimed materials in structural engineering holds significant potential for fostering sustainability and reducing construction waste. This paper explores a focused framework that emphasizes two critical processes: visual scanning of materials and algorithmic matching. The proposed approach demonstrates how advanced technologies like 3D scanning and generative design software can streamline workflows for integrating reclaimed elements into modern architectural designs.&lt;/p&gt;
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Gantovnik, Vladimir, Georges Fadel, and Zafer Gu¨rdal. "An Improved Genetic Algorithm for the Optimization of Composite Structures." In ASME 2006 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2006. http://dx.doi.org/10.1115/detc2006-99423.

Der volle Inhalt der Quelle
Annotation:
This paper describes a new approach for reducing the number of the fitness and constraint function evaluations required by a genetic algorithm (GA) for optimization problems with mixed continuous and discrete design variables. The proposed modification improves the efficiency of the memory constructed in terms of the continuous variables. The work presents the algorithmic implementation of the proposed memory scheme and demonstrates the efficiency of the proposed multivariate approximation procedure for the weight optimization of a segmented open cross section composite beam subjected to axial
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Huang, Yijiang, Latifa Alkhayat, Catherine De Wolf, and Caitlin Mueller. "Algorithmic circular design with reused structural elements: method and tool." In International fib Symposium - Conceptual Design of Structures 2021. fib. The International Federation for Structural Concrete, 2021. http://dx.doi.org/10.35789/fib.proc.0055.2021.cdsymp.p056.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Markov, Igor L., and Dong-Jin Lee. "Algorithmic tuning of clock trees and derived non-tree structures." In 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD). IEEE, 2011. http://dx.doi.org/10.1109/iccad.2011.6105342.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Melnyk, Sergiy I., Sergiy M. Labazov, and Serhii S. Melnyk. "Algorithmic Method of Reconstruction of Subsurface Structures in Georadar Studies." In 2020 IEEE Ukrainian Microwave Week (UkrMW). IEEE, 2020. http://dx.doi.org/10.1109/ukrmw49653.2020.9252683.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Gao, Jiawei, Russell Impagliazzo, Antonina Kolokolova, and Ryan Williams. "Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications." In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611974782.141.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

"EDAPPLETS: A WEB TOOL FOR TEACHING DATA STRUCTURES AND ALGORITHMIC TECHNIQUES." In International Conference on Computer Supported Education. SciTePress - Science and and Technology Publications, 2009. http://dx.doi.org/10.5220/0001980203090312.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Czakoova, Krisztina. "DEVELOPING ALGORITHMIC THINKING BY EDUCATIONAL COMPUTER GAMES." In eLSE 2020. University Publishing House, 2020. http://dx.doi.org/10.12753/2066-026x-20-003.

Der volle Inhalt der Quelle
Annotation:
Basics of algorithmic thinking should not be limited to create right solutions and express them by a computer program, but should also be used a suitable methodology based on problem solving, preferably in a playful way. In many cases at school most of the learners consider the topic of algorithms as hard and not very attractive. For beginners in programming the knowledge of specific algorithms is not so important. The ability to understand principles of algorithms, as well as to find own algorithms for new problems are more desirable. One main educational objective is to know that an algorith
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Algorithmic structures"

1

Striuk, Andrii, Olena Rybalchenko, and Svitlana Bilashenko. Development and Using of a Virtual Laboratory to Study the Graph Algorithms for Bachelors of Software Engineering. [б. в.], 2020. http://dx.doi.org/10.31812/123456789/4462.

Der volle Inhalt der Quelle
Annotation:
The paper presents an analysis of the importance of studying graph algorithms, the reasons for the need to implement this project and its subsequent use. The existing analogues analysis is carried out, due to which a list of advantages and disadvantages is formed and taken into account in developing the virtual laboratory. A web application is created that clearly illustrates the work of graph algorithms, such as Depth-First Search, Dijkstra’s Shortest Path, Floyd- Warshall, Kruskal Minimum Cost Spanning Tree Algorithm. A simple and user- friendly interface is developed and it is supported by
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Shadwick, B. A., W. F. Buell, and J. C. Bowman. Structure-Preserving Integration Algorithms. Defense Technical Information Center, 2000. http://dx.doi.org/10.21236/ada384935.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Yan, Yujie, and Jerome F. Hajjar. Automated Damage Assessment and Structural Modeling of Bridges with Visual Sensing Technology. Northeastern University, 2021. http://dx.doi.org/10.17760/d20410114.

Der volle Inhalt der Quelle
Annotation:
Recent advances in visual sensing technology have gained much attention in the field of bridge inspection and management. Coupled with advanced robotic systems, state-of-the-art visual sensors can be used to obtain accurate documentation of bridges without the need for any special equipment or traffic closure. The captured visual sensor data can be post-processed to gather meaningful information for the bridge structures and hence to support bridge inspection and management. However, state-of-the-practice data postprocessing approaches require substantial manual operations, which can be time-c
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Chun, Joohwan. Fast Array Algorithms for Structured Matrices. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada238977.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Guy, Hannah V., and Ozge Ozduzen. Mainstreaming, Gender and Communication in the UK. Glasgow Caledonian University, 2025. https://doi.org/10.59019/b47sx620.

Der volle Inhalt der Quelle
Annotation:
The DRad 5.2 UK country report studies the online agents of far-right extremism and the ways in which citizens and members of civil society attempt to tackle social and political problems related to radicalisation in the UK. By looking at the patterns of visual political communication on social media platforms, the report showcases everyday expressions of sexism, misogyny, transphobia, and racialisation in the UK. In doing so, it aims to provide a scholarly discussion on the textual and visual affordances pertinent to social media platforms that help reproduce existing power structures and soc
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

GEORGIA INST OF TECH ATLANTA. Graph Minors: Structure Theory and Algorithms. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada266033.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Thomas, Robin. Graph Minors: Structure Theory and Algorithms. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada271851.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Gazonas, George A., Daniel S. Weile, Raymond Wildman, and Anuraag Mohan. Genetic Algorithm Optimization of Phononic Bandgap Structures. Defense Technical Information Center, 2006. http://dx.doi.org/10.21236/ada456655.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Smith, Douglas R. Theory of Algorithm Structure and Design. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada257948.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Ercegovac, Miloes D., and Tomas Lang. On-Line Arithmetic Algorithms and Structures for VLSI. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada203421.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Algorithmic structures" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Dissertationen Bücher
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie