Einloggen

Thematische Bibliographien / Algorithmic structures / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Algorithmic structures.

Zeitschriftenartikel 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 Top-50 Zeitschriftenartikel für die Forschung 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.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

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

11

Bazgan, Cristina, Janka Chlebikova, and Thomas Pontoizeau. "Structural and Algorithmic Properties of 2-Community Structures." Algorithmica 80, no. 6 (2017): 1890–908. http://dx.doi.org/10.1007/s00453-017-0283-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Huang, M. "Implications of forbidden structures for extremal algorithmic problems." Theoretical Computer Science 40 (1985): 245–55. http://dx.doi.org/10.1016/0304-3975(85)90114-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Huang, Ming-Deh A., and Karl J. Lieberherr. "Implications of forbidden structures for extremal algorithmic problems." Theoretical Computer Science 40 (1985): 195–210. http://dx.doi.org/10.1016/0304-3975(85)90166-5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Alaev, Pavel. "Inversion operations in algebraic structures." Computability 12, no. 4 (2023): 315–22. http://dx.doi.org/10.3233/com-230459.

Der volle Inhalt der Quelle

Annotation:

We consider a wide series of classes of algorithmic complexity. We fix such a class and investigate the complexity of the inversion operation in classical algebraic structures, like groups or fields. In addition, we analyze the properties of quotient structures.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Povkhan, I. F. "CONVERGENCE PROBLEM SCHEMES FOR CONSTRUCTING STRUCTURES OF LOGICAL AND ALGORITHMIC CLASSIFICATION TREES." Ukrainian Journal of Information Technology 4, no. 1 (2022): 29–36. http://dx.doi.org/10.23939/ujit2022.01.029.

Der volle Inhalt der Quelle

Annotation:

The problem of convergence of the procedure for synthesizing classifier schemes in the methods of logical and algorithmic classification trees is considered. An upper estimate of the complexity of the algorithm tree scheme is proposed in the problem of approximating an array of real data with a set of generalized features with a fixed criterion for stopping the branching procedure at the stage of constructing a classification tree. This approach allows you to ensure the necessary accuracy of the model, assess its complexity, reduce the number of branches and achieve the necessary performance i

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

H.K.Xoliyorova. "STRUCTURE OF THE ALGORITHMIC SYSTEM OF OPTIMIZATION AND ORGANIZATION OF ITS OPERATION." Sanoatda raqamli texnologiyalar 1, no. 1 (2023): 153–58. https://doi.org/10.5281/zenodo.8386739.

Der volle Inhalt der Quelle

Annotation:

The article describes the organization and structure of the algorithmic and software components of the automated design of optimal engineering structures in the structure of the algorithmic system of optimization and its operation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

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.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

18

Moshkov, Mikhail. "Algorithmic Problems for Computation Trees." Logics 3, no. 2 (2025): 4. https://doi.org/10.3390/logics3020004.

Der volle Inhalt der Quelle

Annotation:

In this paper, we study three algorithmic problems involving computation trees: the optimization, solvability, and satisfiability problems. The solvability problem is concerned with recognizing computation trees that solve problems. The satisfiability problem is concerned with recognizing sentences that are true in at least one structure from a given set of structures. We study how the decidability of the optimization problem depends on the decidability of the solvability and satisfiability problems. We also consider various examples with both decidable and undecidable solvability and satisfia

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Censor, Yair, and Rafiq Mansour. "New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses." SIAM Journal on Optimization 26, no. 1 (2016): 474–87. http://dx.doi.org/10.1137/141001536.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Dalvandi, Mohammadsadegh, Michael Butler, and Abdolbaghi Rezazadeh. "Derivation of algorithmic control structures in Event-B refinement." Science of Computer Programming 148 (November 2017): 49–65. http://dx.doi.org/10.1016/j.scico.2017.05.010.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Tussupov, D. A. "Isomorphisms and Algorithmic Properties of Structures with Two Equivalences." Algebra and Logic 55, no. 1 (2016): 50–57. http://dx.doi.org/10.1007/s10469-016-9375-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

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.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

23

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.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

24

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.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

25

Dobrynina, Irina Vasiljevna. "On algorithmic problems in generalized tree structures of Coxeter groups." Chebyshevskii sbornik 19, no. 2 (2018): 477–90. http://dx.doi.org/10.22405/2226-8383-2018-19-2-477-490.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Allahverdi, Çağdaş, and Yıldız Allahverdi. "Diffusion Limited Aggregation via Python: Dendritic Structures and Algorithmic Art." Journal of Scientific Reports-A, no. 058 (September 29, 2024): 99–112. http://dx.doi.org/10.59313/jsr-a.1454389.

Der volle Inhalt der Quelle

Annotation:

Diffusion limited aggregation (DLA) has attracted much attention due to its simplicity and broad applications in physics such as nano and microparticle aggregations. In this study, the algorithm of DLA is written with Python. Python's Turtle library is used to plot the aggregate on the computer monitor as it grows. The algorithm is run on the Raspberry Pi. A cheap and portable medium is created for DLA simulation. Two different options are placed in the algorithm. The first path does not allow the primary particle to turn outside of the aggregate after the collision. However, the second one al

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Ceballos, Manuel, Juan Núñez, and Ángel F. Tenorio. "Algorithmic method to obtain combinatorial structures associated with Leibniz algebras." Mathematics and Computers in Simulation 125 (July 2016): 126–38. http://dx.doi.org/10.1016/j.matcom.2014.11.001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Arkin, Esther M., Sándor P. Fekete, and Joseph S. B. Mitchell. "An algorithmic study of manufacturing paperclips and other folded structures." Computational Geometry 25, no. 1-2 (2003): 117–38. http://dx.doi.org/10.1016/s0925-7721(02)00133-5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Schoenenberger, Lukas, Alexander Schmid, and Markus Schwaninger. "Towards the algorithmic detection of archetypal structures in system dynamics." System Dynamics Review 31, no. 1-2 (2015): 66–85. http://dx.doi.org/10.1002/sdr.1526.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Kusk, Kalle, and Claus Bossen. "Working with Wolt." Proceedings of the ACM on Human-Computer Interaction 6, GROUP (2022): 1–22. http://dx.doi.org/10.1145/3492823.

Der volle Inhalt der Quelle

Annotation:

In this paper, we present the results of an ethnographic study focusing on food deliveries for the digital platform Wolt. The platform manages food transport ordered by customers to be delivered at home from restaurants, and subcontracts the transport to workers called 'couriers', who act as independent firms or entrepreneurs. The paper is based on six months of participant observation, during which time the first author worked as a courier, as well as on ad-hoc conversations and semi-structured interviews with other couriers. We describe couriers' work for the platform and discuss our finding

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Sagatov, Miraziz, Kholida Komilova, Rustam Maksudov, and Olimzhon Kucharov. "Computerized system of acoustic-emission control of metal structures." E3S Web of Conferences 365 (2023): 02018. http://dx.doi.org/10.1051/e3sconf/202336502018.

Der volle Inhalt der Quelle

Annotation:

Research on the problems of creating effective control and diagnostic systems allows us to single out the following areas: the development of the theory and methods for diagnosing and predicting the strength and reliability of structures, theoretical and experimental studies of fracture processes, and the corresponding changes in characteristics and parameters, i.e., carriers of information about the processes occurring in the material during destruction; creation of information-measuring systems designed to register and analyze the information necessary to resolve the issue of the state of th

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Sfetcu, Lucian. "Algorithmic Management. Theoretical Perspectives and Implications for Organizational Development." Technium Social Sciences Journal 66 (December 7, 2024): 407–15. https://doi.org/10.47577/tssj.v66i1.12127.

Der volle Inhalt der Quelle

Annotation:

Algorithmic management leverages data-driven algorithms and artificial intelligence to automate managerial functions traditionally executed by human managers. This paper provides a comprehensive overview of algorithmic management, exploring its definitions and emergence in gig economy platforms and traditional workplaces. It delves into key sociological and organizational theories—including Weber's bureaucracy, Critical Management Studies (CMS), and technological rationality—to frame the discussion. The impact of algorithmic management on employee autonomy, digital surveillance, and forms of w

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

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.

Der volle Inhalt der Quelle

Annotation:

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 und andere Zitierweisen

34

Dzwierzynska, Jolanta, and Patrycja Lechwar. "Algorithmic-Aided Approach for the Design and Evaluation of Curvilinear Steel Bar Structures of Unit Roofs." Materials 15, no. 10 (2022): 3656. http://dx.doi.org/10.3390/ma15103656.

Der volle Inhalt der Quelle

Annotation:

Rationalization in structural design in the field of steel structures mostly consists inreducing structural material. The aim of this work was to develop an algorithmic-aided, original and practical approach to shaping curvilinear steel bar structures of modular roofs, enabling their optimization. The first stage of shaping consists in creating algorithms that define the structures of shelters made of four roof units. Algorithmic definitions of the structures made it possible to obtain many variants of the roof structures with the adopted preliminary criteria. In order to evaluate the effectiv

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Shen, Lixin, Bruce W. Suter, and Erin E. Tripp. "Algorithmic versatility of SPF-regularization methods." Analysis and Applications 19, no. 01 (2020): 43–69. http://dx.doi.org/10.1142/s0219530520400060.

Der volle Inhalt der Quelle

Annotation:

Sparsity promoting functions (SPFs) are commonly used in optimization problems to find solutions which are sparse in some basis. For example, the [Formula: see text]-regularized wavelet model and the Rudin–Osher–Fatemi total variation (ROF-TV) model are some of the most well-known models for signal and image denoising, respectively. However, recent work demonstrates that convexity is not always desirable in SPFs. In this paper, we replace convex SPFs with their induced nonconvex SPFs and develop algorithms for the resulting model by exploring the intrinsic structures of the nonconvex SPFs. The

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Mersch, Dieter. "Ideen zu einer Kritik ‚algorithmischer‘ Rationalität." Deutsche Zeitschrift für Philosophie 67, no. 5 (2019): 851–73. http://dx.doi.org/10.1515/dzph-2019-0062.

Der volle Inhalt der Quelle

Annotation:

Abstract A critique of algorithmic rationalisation offers at best some initial reasons and preliminary ideas. Critique is understood as a reflection on validity. It is limited to an “epistemological investigation” of the limits of the calculable or of what appears “knowable” in the mode of the algorithmic. The argumentation aims at the mathematical foundations of computer science and goes back to the so-called “foundational crisis of mathematics” at the beginning of the 20th century with the attempt to formalise concepts such as calculability, decidability and provability. The Gödel theorems a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

KOROVINA, MARGARITA, and OLEG KUDINOV. "Positive predicate structures for continuous data." Mathematical Structures in Computer Science 25, no. 8 (2014): 1669–84. http://dx.doi.org/10.1017/s0960129513000315.

Der volle Inhalt der Quelle

Annotation:

In this paper, we develop a general framework for continuous data representations using positive predicate structures. We first show that basic principles of Σ-definability which are used to investigate computability, i.e., existence of a universal Σ-predicate and an algorithmic characterization of Σ-definability hold on all predicate structures without equality. Then we introduce positive predicate structures and show connections between these structures and effectively enumerable topological spaces. These links allow us to study computability over continuous data using logical and topologica

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

GINAT, David. "On Implicit Means of Algorithmic Problem Solving." Olympiads in Informatics 13 (July 13, 2019): 31–39. http://dx.doi.org/10.15388/ioi.2019.03.

Der volle Inhalt der Quelle

Annotation:

Students of challenging algorithmics learn and utilize a variety of problem solving tools. The primary tools are data structures, generic algorithms, and algorithm design techniques. However, for solving challenging problems, one needs more than that. Many creative solutions involve implicit notions, whose creative employments yield elegant, concise, and efficient solutions. We elaborate on such notions and advocate their relevance as valuable means in one’s problem solving toolbox. We display our experience with students who lacked awareness of these notions, and illustrate the relevant role

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Danko, Wktor. "Axiomatizable Classes in Many-Sorted Logics of Programs." Fundamenta Informaticae 8, no. 3-4 (1985): 269–83. http://dx.doi.org/10.3233/fi-1985-83-402.

Der volle Inhalt der Quelle

Annotation:

In this paper many-sorted logics of programs are considered (cf. Wand [16] and [3]). The aim is to characterize classes of structures axiomatizable by sets of algorithmic formulas. The results are formulated in terms of operations on classes of structures axiomatizable in the first order logic.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Goldberg, David Theo. "Coding Time." Critical Times 2, no. 3 (2019): 353–69. http://dx.doi.org/10.1215/26410478-7862517.

Der volle Inhalt der Quelle

Annotation:

Abstract This article analyzes the various ways algorithmic logic structures, streamlines, and delimits the conception of time and memory; orders the logics of social arrangement; and delimits the political. The author considers the ways in which algorithms extend racial discrimination, rendering it less visible, less discernible, and so more difficult to address. He briefly formulates a notion of crypto-value embedded within algorithmic self-conception and elaborates an algorithmic ontology. The latter is distinguished from the contemporary understanding of the post-human. The essay concludes

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Cariow, Aleksandr, and Janusz P. Paplinski. "Algorithmic Structures for Realizing Short-Length Circular Convolutions with Reduced Complexity." Electronics 10, no. 22 (2021): 2800. http://dx.doi.org/10.3390/electronics10222800.

Der volle Inhalt der Quelle

Annotation:

A set of efficient algorithmic solutions suitable to the fully parallel hardware implementation of the short-length circular convolution cores is proposed. The advantage of the presented algorithms is that they require significantly fewer multiplications as compared to the naive method of implementing this operation. During the synthesis of the presented algorithms, the matrix notation of the cyclic convolution operation was used, which made it possible to represent this operation using the matrix–vector product. The fact that the matrix multiplicand is a circulant matrix allows its successful

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Annamalai, Chinnaraji. "Annamalai’s Computing Model for Algorithmic Geometric Series and Its Mathematical Structures." Mathematics and Computer Science 3, no. 1 (2018): 1. http://dx.doi.org/10.11648/j.mcs.20180301.11.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Gao, Jiawei, Russell Impagliazzo, Antonina Kolokolova, and Ryan Williams. "Completeness for First-order Properties on Sparse Structures with Algorithmic Applications." ACM Transactions on Algorithms 15, no. 2 (2019): 1–35. http://dx.doi.org/10.1145/3196275.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Kookos, Ioannis K., and John D. Perkins. "An algorithmic method for the selection of multivariable process control structures." Journal of Process Control 12, no. 1 (2002): 85–99. http://dx.doi.org/10.1016/s0959-1524(00)00063-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Demetrescu, Camil, and Giuseppe F. Italiano. "Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures." Journal of Discrete Algorithms 4, no. 3 (2006): 353–83. http://dx.doi.org/10.1016/j.jda.2005.12.003.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Dong, Ruiwen. "Recent Advances in Algorithmic Problems for Semigroups." ACM SIGLOG News 10, no. 4 (2023): 3–23. http://dx.doi.org/10.1145/3636362.3636365.

Der volle Inhalt der Quelle

Annotation:

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemi-groups of an infinite group G , often represented as a matrix group. Such problems might not be decidable in general. In fact, they gave rise to some of the earliest undecidability results in algorithmic theory. However, the situation changes when the group G satisfies additional constraints. In this survey, we give an overview of the decidability and the complexity of several a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Annamalai, Chinnaraji. "Novel Computation of Algorithmic Geometric Series and Summability." Journal of Algorithms and Computation 50, no. 1 (2018): .151–153. https://doi.org/10.5281/zenodo.10868406.

Der volle Inhalt der Quelle

Annotation:

This paper presents a new mathematical technique for computation of geometric series and summability. This technique uses Annamalai’s computing model of algorithmic geometric series and its mathematical structures for further development of the infinite geometric series and summability. This could be very interesting and informative for current students and researchers.In the research study, a novel technique has been presented for formation and computation of infinite geometric series and summability.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Fischer, Michael, Helmut Masching, Matthias Firl, and Kai Uwe Bletzinger. "Design of Lightweight Composite Structures: A Parameter Free Structural Optimization Approach." Key Engineering Materials 504-506 (February 2012): 1391–96. http://dx.doi.org/10.4028/www.scientific.net/kem.504-506.1391.

Der volle Inhalt der Quelle

Annotation:

This contribution presents computational concepts and algorithmic techniques for simulation and gradient-based optimization of geometrically nonlinear and large-scale finite element models of composite structures. Several industrial application examples illustrate the methods, show the applicability to large problems, and prove the high parallel efficiency.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Xie, Yuzhe, Junjie Zheng, and Kerui Chen. "Impact of algorithmic and data structure implementation to game development." Applied and Computational Engineering 31, no. 1 (2024): 96–103. http://dx.doi.org/10.54254/2755-2721/31/20230130.

Der volle Inhalt der Quelle

Annotation:

Many game developers tend to build their proprietary game engines with various algorithmic and data structure implementations. This work discusses a game made using the Pygame library that utilizes a maze generation algorithm, collision detection algorithm, and 2d shadow drawing algorithm to analyze how programming implementation could impact the game's representation, optimization, and future development. In this paper, various algorithms and data structures are compared based on their characteristic and performance, which leads to an analysis of how the game would differ from its current sta

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Yang, Rui, Evgenios M. Kornaropoulos, and Yue Cheng. "Algorithmic Complexity Attacks on Dynamic Learned Indexes." Proceedings of the VLDB Endowment 17, no. 4 (2023): 780–93. http://dx.doi.org/10.14778/3636218.3636232.

Der volle Inhalt der Quelle

Annotation:

Learned Index Structures (LIS) view a sorted index as a model that learns the data distribution, takes a data element key as input, and outputs the predicted position of the key. The original LIS can only handle lookup operations with no support for updates, rendering it impractical to use for typical workloads. To address this limitation, recent studies have focused on designing efficient dynamic learned indexes. ALEX, as the first and one of the representative dynamic learned index structures, enables dynamism by incorporating a series of design choices, including adaptive key space partitio

APA, Harvard, Vancouver, ISO und andere Zitierweisen

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!