Relevant bibliographies by topics / Algorithmic structures

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Algorithmic structures'

Author: Grafiati
Published: 28 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Algorithmic structures.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "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.

Full text
Abstract:
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, and other styles
2

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.

Full text
Abstract:
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, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mikhailovsky, George. "Structuredness as a Measure of the Complexity of the Structure and the Role of Post-Dissipative Structures and Ratchet Processes in Evolution." Journal of Evolutionary Science 1, no. 2 (2020): 40–52. http://dx.doi.org/10.14302/issn.2689-4602.jes-19-3155.

Full text
Abstract:
As shown earlier, the algorithmic complexity, like Shannon information and Boltzmann entropy, tends to increase in accordance with the general law of complification. However, the algorithmic complexity of most material systems does not reach its maximum, i.e. chaotic state, due to the various laws of nature that create certain structures. The complexity of such structures is very different from the algorithmic complexity, and we intuitively feel that its maximal value should be somewhere between order and chaos. I propose a formula for calculation such structural complexity, which can be calle
APA, Harvard, Vancouver, ISO, and other styles
6

Harizanov, Valentina S. "Computability-Theoretic Complexity of Countable Structures." Bulletin of Symbolic Logic 8, no. 4 (2002): 457–77. http://dx.doi.org/10.2178/bsl/1182353917.

Full text
Abstract:
Computable model theory, also called effective or recursive model theory, studies algorithmic properties of mathematical structures, their relations, and isomorphisms. These properties can be described syntactically or semantically. One of the major tasks of computable model theory is to obtain, whenever possible, computability-theoretic versions of various classical model-theoretic notions and results. For example, in the 1950's, Fröhlich and Shepherdson realized that the concept of a computable function can make van der Waerden's intuitive notion of an explicit field precise. This led to the
APA, Harvard, Vancouver, ISO, and other styles
7

Zenil, Hector, Fernando Soler-Toscano, Jean-Paul Delahaye, and Nicolas Gauvrit. "Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility." PeerJ Computer Science 1 (September 30, 2015): e23. http://dx.doi.org/10.7717/peerj-cs.23.

Full text
Abstract:
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluatingn-dimensional complexity by using ann-dimensional deterministic Turing machine. The technique is interesting because it provides a natural algorithmic process for symmetry breaking generating complexn-dimensional structures from perfectly symmetric and fully deterministic computational rules producing a distribution of patterns as described by algorithmic probability. Algorithmic probability also elegantly connects the frequency of o
APA, Harvard, Vancouver, ISO, and other styles
8

Jarrahi, Mohammad Hossein, Gemma Newlands, Min Kyung Lee, Christine T. Wolf, Eliscia Kinder, and Will Sutherland. "Algorithmic management in a work context." Big Data & Society 8, no. 2 (2021): 205395172110203. http://dx.doi.org/10.1177/20539517211020332.

Full text
Abstract:
The rapid development of machine-learning algorithms, which underpin contemporary artificial intelligence systems, has created new opportunities for the automation of work processes and management functions. While algorithmic management has been observed primarily within the platform-mediated gig economy, its transformative reach and consequences are also spreading to more standard work settings. Exploring algorithmic management as a sociotechnical concept, which reflects both technological infrastructures and organizational choices, we discuss how algorithmic management may influence existing
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Chun-Teh, Francisco J. Martin-Martinez, Gang Seob Jung, and Markus J. Buehler. "Polydopamine and eumelanin molecular structures investigated with ab initio calculations." Chemical Science 8, no. 2 (2017): 1631–41. http://dx.doi.org/10.1039/c6sc04692d.

Full text
Abstract:
A set of computational methods that contains a brute-force algorithmic generation of chemical isomers, molecular dynamics (MD) simulations, and density functional theory (DFT) calculations is reported and applied to investigate nearly 3000 probable molecular structures of polydopamine (PDA) and eumelanin.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "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.

Full text
Abstract:
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, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
Abstract:
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, and other styles
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.

Full text
Abstract:
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, and other styles
6

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

Full text
Abstract:
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, and other styles
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.

Full text
Abstract:
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, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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, and other styles
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.

Full text
Abstract:
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, and other styles
More sources

Books on the topic "Algorithmic structures"

1

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Time structures: Formal description and algorithmic representation. Springer, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

1946-, Bunt Richard B., ed. An introduction to computer science: An algorithmic approach. 2nd ed. McGraw-Hill, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Conceptual data modeling and database design: A fully algorithmic approach : The shortest advisable path. Apple Academic Press, 2015.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Pinyan, Lu, Su Kaile, Wang Lusheng, and SpringerLink (Online service), eds. Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings. Springer Berlin Heidelberg, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Botorog, George Horatiu, and Herbert Kuchen. "Using algorithmic skeletons with dynamic data structures." In Parallel Algorithms for Irregularly Structured Problems. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0030116.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sioutas, Spyros, Gerasimos Vonitsanos, Nikolaos Zacharatos, and Christos Zaroliagis. "Scalable and Hierarchical Distributed Data Structures for Efficient Big Data Management." In Algorithmic Aspects of Cloud Computing. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58628-7_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sioutas, Spyros, Phivos Mylonas, Alexandros Panaretos, et al. "Survey of Machine Learning Algorithms on Spark Over DHT-based Structures." In Algorithmic Aspects of Cloud Computing. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-57045-7_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Schwank, Inge. "Cognitive Structures and Cognitive Strategies in Algorithmic Thinking." In NATO ASI Series. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-662-11334-9_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Segura, Clara, Isabel Pita, Rafael del Vado Vírseda, Ana Isabel Saiz, and Pablo Soler. "Interactive Learning of Data Structures and Algorithmic Schemes." In Computational Science – ICCS 2008. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-69384-0_85.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Algorithmic structures"

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
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, and other styles
6

"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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Poulsen, Seth. "Using Spatio-Algorithmic Problem Solving Strategies to Increase Access to Data Structures." In ITiCSE '20: Innovation and Technology in Computer Science Education. ACM, 2020. http://dx.doi.org/10.1145/3341525.3394004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Iliopoulos, Athanasios, and John G. Michopoulos. "High Performance Parallelized Centroid Estimation of Image Components for Full Field Measurements." In ASME 2014 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/detc2014-34937.

Full text
Abstract:
Full field measurement methods require digital image processing algorithms to accomplish centroid identification of components of the image of a deforming structure and track them through subsequent video frames in order to establish displacement and strain measurements. Unfortunately, these image processing algorithms are the most computationally expensive tasks performed in such methods. In this work we present a set of new algorithms that can be used to identify centroids of image features that are shown to be orders of magnitude faster than conventional algorithms. These algorithms are bas
APA, Harvard, Vancouver, ISO, and other styles
9

del Vado Vírseda, Rafael. "A visualization tool for tutoring the interactive learning of data structures and algorithmic schemes." In the 41st ACM technical symposium. ACM Press, 2010. http://dx.doi.org/10.1145/1734263.1734325.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bei, Xiaohui, Youming Qiao, and Shengyu Zhang. "Networked Fairness in Cake Cutting." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/508.

Full text
Abstract:
We introduce a graphical framework for fair division in cake cutting, where comparisons between agents are limited by an underlying network structure. We generalize the classical fairness notions of envy-freeness and proportionality in this graphical setting. An allocation is called envy-free on a graph if no agent envies any of her neighbor's share, and is called proportional on a graph if every agent values her own share no less than the average among her neighbors, with respect to her own measure. These generalizations enable new research directions in developing simple and efficient algori
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Algorithmic structures"

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
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, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dickinson, Bradley W. Efficient Algorithms and Structures for Robust Signal Processing. Defense Technical Information Center, 1985. http://dx.doi.org/10.21236/ada166147.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dickinson, Bradley W. Efficient Algorithms and Structures for Robust Signal Processing. Defense Technical Information Center, 1986. http://dx.doi.org/10.21236/ada190311.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Algorithmic structures' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography