Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „Algorithmic structures“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
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"
Esponda-Argüero, Margarita. „Techniques for Visualizing Data Structures in Algorithmic Animations“. Information Visualization 9, Nr. 1 (29.01.2009): 31–46. http://dx.doi.org/10.1057/ivs.2008.26.
Der volle Inhalt der QuelleZhu, Guo Jin, Kai Zhang und 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 QuelleKalimullin, I. „Algorithmic reducibilities of algebraic structures“. Journal of Logic and Computation 22, Nr. 4 (10.09.2010): 831–43. http://dx.doi.org/10.1093/logcom/exq046.
Der volle Inhalt der QuelleCohn, H., und A. Kumar. „Algorithmic design of self-assembling structures“. Proceedings of the National Academy of Sciences 106, Nr. 24 (16.06.2009): 9570–75. http://dx.doi.org/10.1073/pnas.0901636106.
Der volle Inhalt der QuelleMikhailovsky, 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, Nr. 2 (23.01.2020): 40–52. http://dx.doi.org/10.14302/issn.2689-4602.jes-19-3155.
Der volle Inhalt der QuelleHarizanov, Valentina S. „Computability-Theoretic Complexity of Countable Structures“. Bulletin of Symbolic Logic 8, Nr. 4 (Dezember 2002): 457–77. http://dx.doi.org/10.2178/bsl/1182353917.
Der volle Inhalt der QuelleZenil, Hector, Fernando Soler-Toscano, Jean-Paul Delahaye und Nicolas Gauvrit. „Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility“. PeerJ Computer Science 1 (30.09.2015): e23. http://dx.doi.org/10.7717/peerj-cs.23.
Der volle Inhalt der QuelleJarrahi, Mohammad Hossein, Gemma Newlands, Min Kyung Lee, Christine T. Wolf, Eliscia Kinder und Will Sutherland. „Algorithmic management in a work context“. Big Data & Society 8, Nr. 2 (Juli 2021): 205395172110203. http://dx.doi.org/10.1177/20539517211020332.
Der volle Inhalt der QuelleRatsaby, Joel, und J. Chaskalovic. „On the algorithmic complexity of static structures“. Journal of Systems Science and Complexity 23, Nr. 6 (Dezember 2010): 1037–53. http://dx.doi.org/10.1007/s11424-010-8465-2.
Der volle Inhalt der QuelleChen, Chun-Teh, Francisco J. Martin-Martinez, Gang Seob Jung und Markus J. Buehler. „Polydopamine and eumelanin molecular structures investigated with ab initio calculations“. Chemical Science 8, Nr. 2 (2017): 1631–41. http://dx.doi.org/10.1039/c6sc04692d.
Der volle Inhalt der QuelleDissertationen zum Thema "Algorithmic structures"
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 QuelleCataloged from PDF version of thesis.
Includes bibliographical references (pages 209-214).
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: Large Submatrix Selection, Maximum Cut (Max-Cut) of a graph and Matrix Completion. The Large Submatrix Selection problem is to find a k x k submatrix of an n x n matrix with i.i.d. standard Gaussian entries, which has the largest average entry. It was shown in [13] using non-constructive methods that the largest average value of a k x k submatrix is 2(1 + o(1) [square root] log n/k with high probability (w.h.p.) when k = O(log n/ log log n). We show that a natural greedy algorithm called Largest Average Submatrix LAS produces a submatrix with average value (1+ o(1)) [square root] 2 log n/k w.h.p. when k is constant and n grows, namely approximately [square root] 2 smaller. Then by drawing an analogy with the problem of finding cliques in random graphs, we propose a simple greedy algorithm which produces a k x k matrix with asymptotically the same average value (1+o(1) [square root] 2log n/k w.h.p., for k = o(log n). Since the maximum clique problem is a special case of the largest submatrix problem and the greedy algorithm is the best known algorithm for finding cliques in random graphs, it is tempting to believe that beating the factor [square root] 2 performance gap suffered by both algorithms might be very challenging. Surprisingly, we show the existence of a very simple algorithm which produces a k x k matrix with average value (1 + o[subscript]k(1) + o(1))(4/3) [square root] 2log n/k for k = o((log n)¹.⁵), that is, with asymptotic factor 4/3 when k grows. To get an insight into the algorithmic hardness of this problem, and motivated by methods originating in the theory of spin glasses, we conduct the so-called expected overlap analysis of matrices with average value asymptotically (1 + o(1))[alpha][square root] 2 log n/k for a fixed value [alpha] [epsilon] [1, fixed value a E [1, [square root]2]. The overlap corresponds to the number of common rows and common columns for pairs of matrices achieving this value. We discover numerically an intriguing phase transition at [alpha]* [delta]= 5[square root]2/(3[square root]3) ~~ 1.3608.. [epsilon] [4/3, [square root]2]: when [alpha] < [alpha]* the space of overlaps is a continuous subset of [0, 1]², whereas [alpha] = [alpha]* marks the onset of discontinuity, and as a result the model exhibits the Overlap Gap Property (OGP) when [alpha] > [alpha]*, appropriately defined. We conjecture that OGP observed for [alpha] > [alpha]* also marks the onset of the algorithmic hardness - no polynomial time algorithm exists for finding matrices with average value at least (1+o(1)[alpha][square root]2log n/k, when [alpha] > [alpha]* and k is a growing function of n. Finding a maximum cut of a graph is a well-known canonical NP-hard problem. We consider the problem of estimating the size of a maximum cut in a random Erdős-Rényi graph on n nodes and [cn] edges. We establish that the size of the maximum cut normalized by the number of nodes belongs to the interval [c/2 + 0.47523[square root]c,c/2 + 0.55909[square root]c] w.h.p. as n increases, for all sufficiently large c. We observe that every maximum size cut satisfies a certain local optimality property, and we compute the expected number of cuts with a given value satisfying this local optimality property. Estimating this expectation amounts to solving a rather involved multi-dimensional large deviations problem. We solve this underlying large deviation problem asymptotically as c increases and use it to obtain an improved upper bound on the Max-Cut value. The lower bound is obtained by application of the second moment method, coupled with the same local optimality constraint, and is shown to work up to the stated lower bound value c/2 + 0.47523[square root]c. We also obtain an improved lower bound of 1.36000n on the Max-Cut for the random cubic graph or any cubic graph with large girth, improving the previous best bound of 1.33773n. Matrix Completion is the problem of reconstructing a rank-k n x n matrix M from a sampling of its entries. We propose a new matrix completion algorithm using a novel sampling scheme based on a union of independent sparse random regular bipartite graphs. We show that under a certain incoherence assumption on M and for the case when both the rank and the condition number of M are bounded, w.h.p. our algorithm recovers an [epsilon]-approximation of M in terms of the Frobenius norm using O(nlog² (1/[epsilon])) samples and in linear time O(nlog² (1/[epsilon])). This provides the best known bounds both on the sample complexity and computational cost for reconstructing (approximately) an unknown low-rank matrix. The novelty of our algorithm is two new steps of thresholding singular values and rescaling singular vectors in the application of the "vanilla" alternating minimization algorithm. The structure of sparse random regular graphs is used heavily for controlling the impact of these regularization steps.
by Quan Li.
Ph. D.
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 QuelleKing, 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 QuelleHashemolhosseini, 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 QuelleENGLISH 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 investigation on the algorithmic methodologies for a component and system reliability analysis can help pave the way towards the implementation of fully stochastic analysis of structures in a computer environment. This study is focused on algorithm development for component and system reliability analysis based on the various proposed methodologies. Truss structures were selected for this purpose due to their simplicity as well as their wide use in the industry. Nevertheless, the algorithms developed in this study can be used for other types of structures such as moment-resisting frames with some simple modi cations. For a component level reliability analysis of structures different methods such as First Order Reliability Methods (FORM) and simulation methods are proposed. However, implementation of these methods for the statistically indeterminate structures is complex due to the implicit relation between the response of the structural system and the load effect. As a result, the algorithm developed for the purpose of component reliability analysis should be based on the concepts of Stochastic Finite Element Methods (SFEM) where a proper link between the finite element analysis of the structure and the reliability analysis methodology is ensured. In this study various algorithms are developed based on the FORM method, Monte Carlo simulation, and the Response Surface Method (RSM). Using the FORM method, two methodologies are considered: one is based on the development of a finite element code where required alterations are made to the FEM code and the other is based on the usage of a commercial FEM package. Different simulation methods are also implemented: Direct Monte Carlo Simulation (DMCS), Latin Hypercube Sampling Monte Carlo (LHCSMC), and Updated Latin Hypercube Sampling Monte Carlo (ULHCSMC). Moreover, RSM is used together with simulation methods. Throughout the thesis, the effciency of these methods was investigated. A Fully Stochastic Finite Element Method (FSFEM) with alterations to the finite element code seems the fastest approach since the linking between the FEM package and reliability analysis is avoided. Simulation methods can also be effectively used for the reliability evaluation where ULHCSMC seemed to be the most efficient method followed by LHCSMC and DMCS. The response surface method is the least straight forward method for an algorithmic component reliability analysis; however, it is useful for the system reliability evaluation. For a system level reliability analysis two methods were considered: the ß-unzipping method and the branch and bound method. The ß-unzipping method is based on a level-wise system reliability evaluation where the structure is modelled at different damaged levels according to its degree of redundancy. In each level, the so-called unzipping intervals are defined for the identification of the critical elements. The branch and bound method is based on the identification of different failure paths of the structure by the expansion of the structural failure tree. The evaluation of the damaged states for both of the methods is the same. Furthermore, both of the methods lead to the development of a parallel-series model for the structural system. The only difference between the two methods is in the search approach used for the failure sequence identification. It was shown that the ß-unzipping method provides a better algorithmic approach for evaluating the system reliability compared to the branch and bound method. Nevertheless, the branch and bound method is a more robust method in the identification of structural failure sequences. One possible way to increase the efficiency of the ß-unzipping method is to define bigger unzipping intervals in each level which can be possible through a computerised analysis. For such an analysis four major modules are required: a general intact structure module, a damaged structure module, a reliability analysis module, and a system reliability module. In this thesis different computer programs were developed for both system and component reliability analysis based on the developed algorithms. The computer programs are presented in the appendices of the thesis.
AFRIKAANSE OPSOMMING: Meeste van die veranderlikes betrokke by die ontwerp en analise van strukture is stogasties in hul aard. Om die onsekerhede betrokke in ontwerp en analise in ag te neem is dit dus van groot belang om 'n ten volle stogastiese analise te kan uitvoer op beide komponent asook stelsel vlak. In teenstelling hiermee is die gerekenariseerde analise van strukture in praktyk gebaseer op deterministiese analise wat nie suksesvol is om die stogastiese aard van ontwerp veranderlikes in ag te neem nie. Dit beteken dat die ondersoek na die algoritmiese metodiek vir komponent en stelsel betroubaarheid analise kan help om die weg te baan na die implementering van ten volle rekenaarmatige stogastiese analise van strukture. Di e studie se fokus is op die ontwikkeling van algoritmes vir komponent en stelsel betroubaarheid analise soos gegrond op verskeie voorgestelde metodes. Vakwerk strukture is gekies vir die doeleinde as gevolg van hulle eenvoud asook hulle wydverspreide gebruik in industrie. Die algoritmes wat in die studie ontwikkel is kan nietemin ook vir ander tipes strukture soos moment-vaste raamwerke gebruik word, gegewe eenvoudige aanpassings. Vir 'n komponent vlak betroubaarheid analise van strukture word verskeie metodes soos die "First Order Reliability Methods" (FORM) en simulasie metodes voorgestel. Die implementering van die metodes vir staties onbepaalbare strukture is ingewikkeld as gevolg van die implisiete verband tussen die gedrag van die struktuur stelsel en die las effek. As 'n gevolg, moet die algoritme wat ontwikkel word vir die doel van komponent betroubaarheid analise gebaseer word op die konsepte van stogastiese eindige element metodes ("SFEM") waar 'n duidelike verband tussen die eindige element analise van die struktuur en die betroubaarheid analise verseker is. In hierdie studie word verskeie algoritmes ontwikkel wat gebaseer is op die FORM metode, Monte Carlo simulasie, en die sogenaamde "Response Surface Method" (RSM). Vir die gebruik van die FORM metode word twee verdere metodologieë ondersoek: een gebaseer op die ontwikkeling van 'n eindige element kode waar nodige verandering aan die eindige element kode self gemaak word en die ander waar 'n kommersiële eindige element pakket gebruik word. Verskillende simulasie metodes word ook geïmplimenteer naamlik Direkte Monte Carlo Simulasie (DMCS), "Latin Hypercube Sampling Monte Carlo" (LHCSMC) en sogenaamde "Updated Latin Hypercube Sampling Monte Carlo" (ULHCSMC). Verder, word RSM tesame met die simulasie metodes gebruik. In die tesis word die doeltreffendheid van die bostaande metodes deurgaans ondersoek. 'n Ten volle stogastiese eindige element metode ("FSFEM") met verandering aan die eindige element kode blyk die vinnigste benadering te wees omdat die koppeling tussen die eindige element metode pakket en die betroubaarheid analise verhoed word. Simulasie metodes kan ook effektief aangewend word vir die betroubaarheid evaluasie waar ULHCSMC as die mees doeltre end voorgekom het, gevolg deur LHCSMC en DMCS. The RSM metode is die mees komplekse metode vir algoritmiese komponent betroubaarheid analise. Die metode is egter nuttig vir sisteem betroubaarheid analise. Vir sisteem-vlak betroubaarheid analise is twee metodes oorweeg naamlik die "ß-unzipping" metode and die "branch-and-bound" metode. Die "ß-unzipping" metode is gebaseer op 'n sisteem-vlak betroubaarheid ontleding waar die struktuur op verskillende skade vlakke gemodelleer word soos toepaslik vir die hoeveelheid addisionele las paaie. In elke vlak word die sogenaamde "unzipping" intervalle gedefinieer vir die identifikasie van die kritiese elemente. Die "branch-and-bound" metode is gebaseer op die identifikasie van verskillende faling roetes van die struktuur deur uitbreiding van die falingsboom. The ondersoek van die skade toestande vir beide metodes is dieselfde. Verder kan beide metodes lei tot die ontwikkeling van 'n parallelserie model van die strukturele stelsel. Die enigste verskil tussen die twee metodes is in die soek-benadering vir die uitkenning van falingsmodus volgorde. Dit word getoon dat die "ß-unzipping" metode 'n beter algoritmiese benadering is vir die ontleding van sisteem betroubaarheid vergeleke met die "branch-and-bound" metode. Die "branch-and- bound" metode word nietemin as 'n meer robuuste metode vir die uitkenning van die falings volgorde beskou. Een moontlike manier om die doeltre endheid van die "ß-unzipping" metode te verhoog is om groter "unzipping" intervalle te gebruik, wat moontlik is vir rekenaarmatige analise. Vir so 'n analise word vier hoof modules benodig naamlik 'n algemene heel-struktuur module, 'n beskadigde-struktuur module, 'n betroubaarheid analise module en 'n sisteem betroubaarheid analise module. In die tesis word verskillende rekenaar programme ontwikkel vir beide sisteem en komponent betroubaarheid analise. Die rekenaar programme word in die aanhangsels van die tesis aangebied.
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 QuelleGeometric Algebra is considered as a very intuitive tool to deal with geometric problems and it appears to be increasingly efficient and useful to deal with computer graphics problems. The Conformal Geometric Algebra includes circles, spheres, planes and lines as algebraic objects, and intersections between these objects are also algebraic objects. More complex objects such as conics, quadric surfaces can also be expressed and be manipulated using an extension of the conformal Geometric Algebra. However due to the high dimension of their representations in Geometric Algebra, implementations of Geometric Algebra that are currently available do not allow efficient realizations of these objects. In this thesis, we first present a Geometric Algebra implementation dedicated for both low and high dimensions. The proposed method is a hybrid solution that includes precomputed code with fast execution for low dimensional vector space, which is somehow equivalent to the state of the art method. For high dimensional vector spaces, we propose runtime computations with low memory requirement. For these high dimensional vector spaces, we introduce new recursive scheme and we prove that associated algorithms are efficient both in terms of computationnal and memory complexity. Furthermore, some rules are defined to select the most appropriate choice, according to the dimension of the algebra and the type of multivectors involved in the product. We will show that the resulting implementation is well suited for high dimensional spaces (e.g. algebra of dimension 15) as well as for lower dimensional spaces. The next part presents an efficient representation of quadric surfaces using Geometric Algebra. We define a novel Geometric Algebra framework, the Geometric Algebra of $mathbb{R}^{9,6}$ to deal with quadric surfaces where an arbitrary quadric surface is constructed by merely the outer product of nine points. We show that the proposed framework enables us not only to intuitively represent quadric surfaces but also to construct objects using Conformal Geometric Algebra. In the proposed framework, the computation of the intersection of quadric surfaces, the normal vector, and the tangent plane of a quadric surface are provided. Finally, a computational framework of the quadric surfaces will be presented with the main operations required in computer graphics
Raymond, Jean-Florent. „Structural and algorithmic aspects of partial orderings of graphs“. Thesis, Montpellier, 2016. http://www.theses.fr/2016MONTT289.
Der volle Inhalt der QuelleThe central theme of this thesis is the study of the properties of the classes of graphs defined by forbidden substructures and their applications.The first direction that we follow concerns well-quasi-orders. Using decomposition theorems on graph classes forbidding one substructure, we identify those that are well-quasi-ordered. The orders and substructures that we consider are those related to the notions of contraction and induced minor.Then, still considering classes of graphs defined by forbidden substructures, we obtain bounds on invariants such as degree, treewidth, tree-cut width, and a new invariant generalizing the girth.The third direction is the study of the links between the combinatorial invariants related to problems of packing and covering of graphs. In this direction, we establish new connections between these invariants for some classes of graphs. We also present algorithmic applications of the results
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 QuelleMohan, 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 QuelleBallage, 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 QuelleGenerating a conformal mesh on complex geometries leads to important model size of structural finite element simulations. The meshing time is directly linked to the geometry complexity and can contribute significantly to the total turnaround time. Graphics processing units (GPUs) are highly parallel programmable processors, delivering real performance gains on computationally complex, large problems. GPUs are used to implement a new finite element method on a Cartesian mesh. A Cartesian mesh is well adapted to the parallelism needed by GPUs and reduces the meshing time to almost zero. The novel method relies on the finite element method and the extended finite element formulation. The extended finite element method was introduced in the field of fracture mechanics. It consists in enriching the basis functions to take care of the geometry and the interface. This method doesn't need a conformal mesh to represent cracks and avoids refining during their propagation. Our method is based on the extended finite element method, with a geometry implicitly defined, wich allows for a good approximation of the geometry and boundary conditions without a conformal mesh.To represent the model on a Cartesian grid, we use a level set representing a density. This density is greater than 0.5 inside the domain and less than 0.5 outside. It takes 0.5 on the boundary. A new integration technique is proposed, adapted to the geometrical representation. For the element cut by the levet set, only the part full of material has to be integrated. The Gauss quadrature is no longer adapted. We introduce a quadrature method with integration points on a cartesian dense grid.In order to reduce the computational effort, a learning approach is then considered to form the elementary stiffness matrices as function of density values on the vertices of the elements. This learning method reduces the stiffness matrices time computation. Results obtained after analysis by finite element method or the novel finite element method can have important storage size, dependant of the model complexity and the resolution scheme exactitude. Due to the limited direct memory of graphics processing units, the data results are compressed. We compress the model and the element finite results with a wavelet transform. The compression will help for storage issue and also for data visualization
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 QuelleIn this thesis, we present an algorithmic approach allowing the generation of construction guides of organic molecular cages. These semi-molecular architectures have a defined internal space capable of trapping a target molecule called substrate. Many works propose to generate molecular organic cages obtained from symmetrical structures, which have a good complexity, but they are not specific because they do not take into account precise targets. The proposed approach makes it possible to generate guides for the construction of organic molecular cages specific to a given substrate. In order to ensure the specificity of the molecular cage for the target substrate, an intermediate structure, which is an expansion of the envelope of the target substrate, is used. This structure defines the shape of the space in which the substrate is trapped. Small sets of atoms, called molecular binding patterns, are then integrated into this intermediate structure. These molecular patterns are the sets of atoms needed by molecular cages to allow them to interact with the substrate to capture it
Bücher zum Thema "Algorithmic structures"
Hajnicz, Elżbieta. Time structures: Formal description and algorithmic representation. Berlin: Springer, 1996.
Den vollen Inhalt der Quelle findenTime structures: Formal description and algorithmic representation. Berlin: Springer, 1996.
Den vollen Inhalt der Quelle findenEngeler, Erwin. Algorithmic properties of structures: Selected papers of E. Engeler. Singapore: World Scientific, 1993.
Den vollen Inhalt der Quelle findenAlgorithmic properties of structure: Selected papers of Erwin Engeler. Singapore: World Scientific, 1993.
Den vollen Inhalt der Quelle finden1946-, Bunt Richard B., Hrsg. An introduction to computer science: An algorithmic approach. 2. Aufl. New York: McGraw-Hill, 1989.
Den vollen Inhalt der Quelle findenJean-Paul, Tremblay. An introduction to computer science: An algorithmic approach. New York: McGraw-Hill, 1989.
Den vollen Inhalt der Quelle findenConceptual data modeling and database design: A fully algorithmic approach : The shortest advisable path. Oakville, ON: Apple Academic Press, 2015.
Den vollen Inhalt der Quelle findenAtallah, Mikhail. Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011.
Den vollen Inhalt der Quelle findenPinyan, Lu, Su Kaile, Wang Lusheng und SpringerLink (Online service), Hrsg. Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Den vollen Inhalt der Quelle findenFellows, 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. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Algorithmic structures"
Mahout, Vincent. „Algorithmic and Data Structures“. In Assembly Language Programming, 87–118. Hoboken, NJ USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118562123.ch6.
Der volle Inhalt der QuelleMöller, Bernhard. „Calculating With Pointer Structures“. In Algorithmic Languages and Calculi, 24–48. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-0-387-35264-0_2.
Der volle Inhalt der QuelleNovosád, Tomá, Václav Snáel, Ajith Abraham und Jack Y. Yang. „Discovering 3D Protein Structures for Optimal Structure Alignment“. In Algorithmic and Artificial Intelligence Methods for Protein Bioinformatics, 281–98. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118567869.ch14.
Der volle Inhalt der QuelleChen, Danny Z., und Ewa Misiołek. „Algorithms for Interval Structures with Applications“. In Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 196–207. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21204-8_23.
Der volle Inhalt der QuelleNievergelt, Jürg, und Peter Widmayer. „Spatial data structures: Concepts and design choices“. In Algorithmic Foundations of Geographic Information Systems, 153–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63818-0_6.
Der volle Inhalt der QuelleBotorog, George Horatiu, und Herbert Kuchen. „Using algorithmic skeletons with dynamic data structures“. In Parallel Algorithms for Irregularly Structured Problems, 263–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0030116.
Der volle Inhalt der QuelleSioutas, Spyros, Gerasimos Vonitsanos, Nikolaos Zacharatos und Christos Zaroliagis. „Scalable and Hierarchical Distributed Data Structures for Efficient Big Data Management“. In Algorithmic Aspects of Cloud Computing, 122–60. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58628-7_8.
Der volle Inhalt der QuelleSioutas, Spyros, Phivos Mylonas, Alexandros Panaretos, Panagiotis Gerolymatos, Dimitrios Vogiatzis, Eleftherios Karavaras, Thomas Spitieris und Andreas Kanavos. „Survey of Machine Learning Algorithms on Spark Over DHT-based Structures“. In Algorithmic Aspects of Cloud Computing, 146–56. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-57045-7_9.
Der volle Inhalt der QuelleSchwank, Inge. „Cognitive Structures and Cognitive Strategies in Algorithmic Thinking“. In NATO ASI Series, 249–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-662-11334-9_22.
Der volle Inhalt der QuelleSegura, Clara, Isabel Pita, Rafael del Vado Vírseda, Ana Isabel Saiz und Pablo Soler. „Interactive Learning of Data Structures and Algorithmic Schemes“. In Computational Science – ICCS 2008, 800–809. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-69384-0_85.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Algorithmic structures"
Huang, Yijiang, Latifa Alkhayat, Catherine De Wolf und 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 QuelleGao, Jiawei, Russell Impagliazzo, Antonina Kolokolova und 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. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611974782.141.
Der volle Inhalt der QuelleMarkov, Igor L., und 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 QuelleMelnyk, Sergiy I., Sergiy M. Labazov und 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 QuelleGantovnik, Vladimir, Georges Fadel und 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„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 QuellePoulsen, Seth. „Using Spatio-Algorithmic Problem Solving Strategies to Increase Access to Data Structures“. In ITiCSE '20: Innovation and Technology in Computer Science Education. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3341525.3394004.
Der volle Inhalt der QuelleIliopoulos, Athanasios, und 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.
Der volle Inhalt der Quelledel Vado Vírseda, Rafael. „A visualization tool for tutoring the interactive learning of data structures and algorithmic schemes“. In the 41st ACM technical symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1734263.1734325.
Der volle Inhalt der QuelleBei, Xiaohui, Youming Qiao und Shengyu Zhang. „Networked Fairness in Cake Cutting“. In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/508.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Algorithmic structures"
Shadwick, B. A., W. F. Buell und J. C. Bowman. Structure-Preserving Integration Algorithms. Fort Belvoir, VA: Defense Technical Information Center, November 2000. http://dx.doi.org/10.21236/ada384935.
Der volle Inhalt der QuelleYan, Yujie, und Jerome F. Hajjar. Automated Damage Assessment and Structural Modeling of Bridges with Visual Sensing Technology. Northeastern University, Mai 2021. http://dx.doi.org/10.17760/d20410114.
Der volle Inhalt der QuelleChun, Joohwan. Fast Array Algorithms for Structured Matrices. Fort Belvoir, VA: Defense Technical Information Center, Juni 1989. http://dx.doi.org/10.21236/ada238977.
Der volle Inhalt der QuelleThomas, Robin. Graph Minors: Structure Theory and Algorithms. Fort Belvoir, VA: Defense Technical Information Center, Januar 1993. http://dx.doi.org/10.21236/ada271851.
Der volle Inhalt der QuelleGEORGIA INST OF TECH ATLANTA. Graph Minors: Structure Theory and Algorithms. Fort Belvoir, VA: Defense Technical Information Center, April 1993. http://dx.doi.org/10.21236/ada266033.
Der volle Inhalt der QuelleGazonas, George A., Daniel S. Weile, Raymond Wildman und Anuraag Mohan. Genetic Algorithm Optimization of Phononic Bandgap Structures. Fort Belvoir, VA: Defense Technical Information Center, September 2006. http://dx.doi.org/10.21236/ada456655.
Der volle Inhalt der QuelleSmith, Douglas R. Theory of Algorithm Structure and Design. Fort Belvoir, VA: Defense Technical Information Center, September 1992. http://dx.doi.org/10.21236/ada257948.
Der volle Inhalt der QuelleErcegovac, Miloes D., und Tomas Lang. On-Line Arithmetic Algorithms and Structures for VLSI. Fort Belvoir, VA: Defense Technical Information Center, November 1988. http://dx.doi.org/10.21236/ada203421.
Der volle Inhalt der QuelleDickinson, Bradley W. Efficient Algorithms and Structures for Robust Signal Processing. Fort Belvoir, VA: Defense Technical Information Center, Mai 1985. http://dx.doi.org/10.21236/ada166147.
Der volle Inhalt der QuelleDickinson, Bradley W. Efficient Algorithms and Structures for Robust Signal Processing. Fort Belvoir, VA: Defense Technical Information Center, September 1986. http://dx.doi.org/10.21236/ada190311.
Der volle Inhalt der Quelle