Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „Graphe de code“
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 "Graphe de code" 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 "Graphe de code"
Azkarate, Igor, Mikel Ayani, Juan Carlos Mugarza und Luka Eciolaza. „Petri Net-Based Semi-Compiled Code Generation for Programmable Logic Controllers“. Applied Sciences 11, Nr. 15 (03.08.2021): 7161. http://dx.doi.org/10.3390/app11157161.
Der volle Inhalt der QuelleMÜLLER, T., und J. S. SERENI. „Identifying and Locating–Dominating Codes in (Random) Geometric Networks“. Combinatorics, Probability and Computing 18, Nr. 6 (11.08.2009): 925–52. http://dx.doi.org/10.1017/s0963548309990344.
Der volle Inhalt der QuelleHudry, Olivier, Junnila Ville und Antoine Lobstein. „On Iiro Honkala’s Contributions to Identifying Codes“. Fundamenta Informaticae 191, Nr. 3-4 (22.07.2024): 165–96. http://dx.doi.org/10.3233/fi-242178.
Der volle Inhalt der QuelleSaenpholphat, Varaporn, und Ping Zhang. „Conditional resolvability in graphs: a survey“. International Journal of Mathematics and Mathematical Sciences 2004, Nr. 38 (2004): 1997–2017. http://dx.doi.org/10.1155/s0161171204311403.
Der volle Inhalt der QuelleJosé, Marco, und Gabriel Zamudio. „Symmetrical Properties of Graph Representations of Genetic Codes: From Genotype to Phenotype“. Symmetry 10, Nr. 9 (08.09.2018): 388. http://dx.doi.org/10.3390/sym10090388.
Der volle Inhalt der QuelleTang, C. S., und Tyng Liu. „The Degree Code—A New Mechanism Identifier“. Journal of Mechanical Design 115, Nr. 3 (01.09.1993): 627–30. http://dx.doi.org/10.1115/1.2919236.
Der volle Inhalt der QuelleLeslie, Martin. „Hypermap-homology quantum codes“. International Journal of Quantum Information 12, Nr. 01 (Februar 2014): 1430001. http://dx.doi.org/10.1142/s0219749914300010.
Der volle Inhalt der QuelleSchlingemann, D. „Stabilizer codes can be realized as graph codes“. Quantum Information and Computation 2, Nr. 4 (Juni 2002): 307–23. http://dx.doi.org/10.26421/qic2.4-4.
Der volle Inhalt der QuelleHwang, Yongsoo, und Jun Heo. „On the relation between a graph code and a graph state“. Quantum Information and Computation 16, Nr. 3&4 (März 2016): 237–50. http://dx.doi.org/10.26421/qic16.3-4-3.
Der volle Inhalt der QuelleAl-Kadhimi, Aymen M., Ammar E. Abdulkareem und Charalampos C. Tsimenidis. „Performance Enhancement of LDPC Codes Based on Protograph Construction in 5G-NR Standard“. Tikrit Journal of Engineering Sciences 30, Nr. 4 (01.11.2023): 1–10. http://dx.doi.org/10.25130/tjes.30.4.1.
Der volle Inhalt der QuelleDissertationen zum Thema "Graphe de code"
Bertrand, Sébastien. „Modèle de maintenabilité logicielle par analyse statique du graphe de code du programme“. Electronic Thesis or Diss., Bordeaux, 2024. http://www.theses.fr/2024BORD0414.
Der volle Inhalt der QuelleThe high cost of software maintenance requires a focus on software maintainability. Although it emerges from the structure of the source code, its evaluation is subjective, as it depends on developers and the context. Current maintainability models tend to reduce maintainability to a one-dimensional score based on metrics, often poorly defined, which inadequately represent the structure of the code. Our work is based on the static analysis of code graphs to evaluate maintainability. It led to the development of Javanalyser, an open-source tool that automatically generates the code graph of a Java program. These graphs enabled the formalization of 33 static metrics as declarative queries, and allowed the successful replication of a study by Schnappinger et al. Our extension of the study confirmed the importance of size as a factor influencing maintainability, while also recognizing the impact of other metrics. This work opens the way to a deeper understanding of maintainability through a multidimensional representation that takes into account the variability between developers
Roux, Antoine. „Etude d’un code correcteur linéaire pour le canal à effacements de paquets et optimisation par comptage de forêts et calcul modulaire“. Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS337.
Der volle Inhalt der QuelleReliably transmitting information over a transmission channel is a recurrent problem in Informatic Sciences. Whatever may be the channel used to transmit information, we automatically observe erasure of this information, or pure loss. Different solutions can be used to solve this problem, using forward error correction codes is one of them. In this thesis, we study a corrector code developped in 2014 and 2015 for Thales society during my second year of master of apprenticeship. It is currently used to ensure the reliability of a transmission based on the UDP protocole, and passing by a network diode, Elips-SD. Elip-SD is an optical diode that can be plugged on an optical fiber to physically ensure that the transmission is unidirectional. The main usecase of such a diode is to enable supervising a critical site, while ensuring that no information can be transmitted to this site. At the opposite, another usecase is the transmission from one or multiple unsecured emitters to one secured receiver who wants to ensure that no information can be robbed. The corrector code that we present is a linear corrector code for the binary erasure channel using packets, that obtained the NATO certification from the DGA ("Direction Générale de Armées" in French). We named it Fauxtraut, for "Fast algorithm using Xor to repair altered unidirectional transmissions". In order to study this code, presenting how it works, its performance and the modifications we added during this thesis, we first establish a state of the art of forward error correction, focusing on non-MDS linear codes such as LDPC codes. Then we present Fauxtraut behavior, and analyse it theorically and with simulations. Finally, we present different versions of this code that were developped during this thesis, leading to other usecases such as transmitting reliable information that can be altered instead of being erased, or on a bidirectionnal channel, such as the H-ARQ protocole, and different results on the number of cycles in particular graphs. In the last part, we present results that we obtained during this thesis and that finally lead to an article in the Technical Computer Science. It concerns a non-polynomial problema of Graphs theorie : maximum matching in temporal graphs. In this article, we propose two algorithms with polynomial complexity : a 2-approximation algorithm and a kernelisation algorithm forthis problema
Richa, Elie. „Qualification des générateurs de code source dans le domaine de l'avionique : le test automatisé des chaines de transformation de modèles“. Thesis, Paris, ENST, 2015. http://www.theses.fr/2015ENST0082/document.
Der volle Inhalt der QuelleIn the avionics industry, Automatic Code Generators (ACG) are increasingly used to produce parts of the embedded software. Since the generated code is part of critical software, safety standards require a thorough verification of the ACG called qualification. In this thesis in collaboration with AdaCore, we seek to reduce the cost of testing activities by automatic and effective methods.The first part of the thesis addresses the topic of unit testing which ensures exhaustiveness but is difficult to achieve for ACGs. We propose a method that guarantees the same level of exhaustiveness by using only integration tests which are easier to carry out. First, we propose a formalization of the ATL language in which the ACG is defined in the Algebraic Graph Transformation theory. We then define a translation of postconditions expressing the exhaustiveness of unit testing into equivalent preconditions that ultimately support the production of integration tests providing the same level of exhaustiveness. Finally, we propose to optimize the complex algorithm of our analysis using simplification strategies that we assess experimentally.The second part of the work addresses the oracles of ACG tests, i.e. the means of validating the code generated by the ACG during a test. We propose a language for the specification of textual constraints able to automatically check the validity of the generated code. This approach is experimentally deployed at AdaCore for a Simulink® to Ada/C ACG called QGen
Richa, Elie. „Qualification des générateurs de code source dans le domaine de l'avionique : le test automatisé des chaines de transformation de modèles“. Electronic Thesis or Diss., Paris, ENST, 2015. http://www.theses.fr/2015ENST0082.
Der volle Inhalt der QuelleIn the avionics industry, Automatic Code Generators (ACG) are increasingly used to produce parts of the embedded software. Since the generated code is part of critical software, safety standards require a thorough verification of the ACG called qualification. In this thesis in collaboration with AdaCore, we seek to reduce the cost of testing activities by automatic and effective methods.The first part of the thesis addresses the topic of unit testing which ensures exhaustiveness but is difficult to achieve for ACGs. We propose a method that guarantees the same level of exhaustiveness by using only integration tests which are easier to carry out. First, we propose a formalization of the ATL language in which the ACG is defined in the Algebraic Graph Transformation theory. We then define a translation of postconditions expressing the exhaustiveness of unit testing into equivalent preconditions that ultimately support the production of integration tests providing the same level of exhaustiveness. Finally, we propose to optimize the complex algorithm of our analysis using simplification strategies that we assess experimentally.The second part of the work addresses the oracles of ACG tests, i.e. the means of validating the code generated by the ACG during a test. We propose a language for the specification of textual constraints able to automatically check the validity of the generated code. This approach is experimentally deployed at AdaCore for a Simulink® to Ada/C ACG called QGen
Robillard, Benoît. „Verification formelle et optimisation de l’allocation de registres“. Electronic Thesis or Diss., Paris, CNAM, 2010. http://www.theses.fr/2010CNAM0730.
Der volle Inhalt der QuelleThe need for trustful programs led to an increasing use of formal verication techniques the last decade, and especially of program proof. However, the code running on the computer is not the source code, i.e. the one written by the developper, since it has to betranslated by the compiler. As a result, the formal verication of compilers is required to complete the source code verication. One of the hardest phases of compilation is register allocation. Register allocation is the phase within which the compiler decides where the variables of the program are stored in the memory during its execution. The are two kinds of memory locations : a limited number of fast-access zones, called registers, and a very large but slow-access stack. The aim of register allocation is then to make a great use of registers, leading to a faster runnable code.The most used model for register allocation is the interference graph coloring one. In this thesis, our objective is twofold : first, formally verifying some well-known interference graph coloring algorithms for register allocation and, second, designing new graph-coloring register allocation algorithms. More precisely, we provide a fully formally veri ed implementation of the Iterated Register Coalescing, a very classical graph-coloring register allocation heuristics, that has been integrated into the CompCert compiler. We also studied two intermediate representations of programs used in compilers, and in particular the SSA form to design new algorithms, using global properties of the graph rather than local criteria currently used in the litterature
Robillard, Benoît. „Verification formelle et optimisation de l’allocation de registres“. Thesis, Paris, CNAM, 2010. http://www.theses.fr/2010CNAM0730/document.
Der volle Inhalt der QuelleThe need for trustful programs led to an increasing use of formal verication techniques the last decade, and especially of program proof. However, the code running on the computer is not the source code, i.e. the one written by the developper, since it has to betranslated by the compiler. As a result, the formal verication of compilers is required to complete the source code verication. One of the hardest phases of compilation is register allocation. Register allocation is the phase within which the compiler decides where the variables of the program are stored in the memory during its execution. The are two kinds of memory locations : a limited number of fast-access zones, called registers, and a very large but slow-access stack. The aim of register allocation is then to make a great use of registers, leading to a faster runnable code.The most used model for register allocation is the interference graph coloring one. In this thesis, our objective is twofold : first, formally verifying some well-known interference graph coloring algorithms for register allocation and, second, designing new graph-coloring register allocation algorithms. More precisely, we provide a fully formally veri ed implementation of the Iterated Register Coalescing, a very classical graph-coloring register allocation heuristics, that has been integrated into the CompCert compiler. We also studied two intermediate representations of programs used in compilers, and in particular the SSA form to design new algorithms, using global properties of the graph rather than local criteria currently used in the litterature
Stange, Yuri. „Visualization of Code Flow“. Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-162108.
Der volle Inhalt der QuelleVisuell representation av flödesscheman (eng. Control Flow Graph, CFG) är en funktion tillgänglig hos många verktyg, bland annat dekompilerare. Dessa verktyg använder sig ofta av grafritande ramverk som implementerar Sugiyamas metod för uppritning av hierarkiska grafer, vilken är en känd metod för uppritning av riktade grafer. Sugiyamas stora nackdelär att metoden inte tar hänsyn till grafens natur, loopar i synnerhet behandlas som andra klassens medborgare. Frågeställningen hos denna rapport är; Hur kan vi förbättra den visuella representationen av loopar i en graf? En metod som bygger vidare på Sugiyama-ramverket utvecklades och implementerades i Qt. Metoden testades genom att hålla informella kvalitativa intervjuer med testpersoner, vilka fick testa implementeringen och jämföra den med den vanliga Sugiyama-metoden. Resultaten visar att alla testpersonerna stämmer in på att loopar, så väl som den overskådliga representionen av grafen förbättrades, dock med vissa reservationer. Metoden som presenteras i denna rapport har vissa problem, vilka bör adresseras innan den kan ses som en optimal lösning för uppritning av flödesscheman.
Li, Chao. „Semidefinite programming, binary codes and a graph coloring problem“. Digital WPI, 2015. https://digitalcommons.wpi.edu/etd-theses/863.
Der volle Inhalt der QuelleSaeed, Mohamed Ahmed. „Approche algébrique sur l'équivalence de codes“. Thesis, Normandie, 2017. http://www.theses.fr/2017NORMR034/document.
Der volle Inhalt der QuelleCode equivalence problem plays an important role in coding theory and code based cryptography.That is due to its significance in classification of codes and also construction and cryptanalysis of code based cryptosystems. It is also related to the long standing problem of graph isomorphism, a well-known problem in the world of complexity theory. We introduce new method for solving code equivalence problem. We develop algebraic approaches to solve the problem in its permutation and diagonal versions. We build algebraic system by establishing relations between generator matrices and parity check matrices of the equivalent codes. We end up with system of multivariables of linear and quadratic equations which can be solved using algebraic tools such as Groebner basis and related techniques. By using Groebner basis techniques we can solve the code equivalence but the computation becomes complex as the length of the code increases. We introduced several improvements such as block linearization and Frobenius action. Using these techniques we identify many cases where permutation equivalence problem can be solved efficiently. Our method for diagonal equivalence solves the problem efficiently in small fields, namely F3 and F4. The increase in the field size results in an increase in the number of variables in our algebraic system which makes it difficult to solve. We introduce a new reduction from permutation code equivalence when the hull is trivial to graph isomorphism. This shows that this subclass of permutation equivalence is not harder than graph isomorphism.Using this reduction we obtain an algebraic system for graph isomorphism with interesting properties in terms of the rank of the linear part and the number of variables. We solve the graph isomorphism problem efficiently for random graphs with large number of vertices and also for some regular graphs such as Petersen, Cubical and Wagner Graphs
Lestringant, Pierre. „Identification d'algorithmes cryptographiques dans du code natif“. Thesis, Rennes 1, 2017. http://www.theses.fr/2017REN1S067/document.
Der volle Inhalt der QuelleThis thesis is about the design of automatic or semi-automatic methods to detect and identify cryptographic algorithms inside programs compiled into machine code. Two methods are presented. The objective of the first method is to identify cryptographic primitives. A machine code implementation of a cryptographic primitive, regarded as a sequence of instructions, is represented by a graph structure. During a normalization phase, a set of rewrite rules is used to modify this graph representation while preserving a specific notion of semantics. The goal is to converge towards expressions which are shared across several implementations of the same primitive. We use these expressions as a basis to create efficient signatures. A subgraph isomorphism enumeration algorithm is used to search for signatures. The second method is built on top of the first one. It produces a synthetic representation designed to help in the identification of modes of operation. This synthetic representation is defined as the smallest subgraph which preserve distances between sets of vertices previously identified as the input and output parameters of the primitives involved within the mode of operation
Bücher zum Thema "Graphe de code"
Blahut, Richard E., und Ralf Koetter, Hrsg. Codes, Graphs, and Systems. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4615-0895-3.
Der volle Inhalt der QuelleFoo, Simon. Convolutional codes on cayley graphs. Ottawa: National Library of Canada, 2002.
Den vollen Inhalt der Quelle findenTonchev, Vladimir. Combinatorial configurations: Designs, codes, graphs. Harlow, Essex, England: Longman Scientific & Technical, 1988.
Den vollen Inhalt der Quelle findenTonchev, Vladimir D. Combinatorial configurations: Designs, codes, graphs. Harlow: Longman Scientific & Technical, 1988.
Den vollen Inhalt der Quelle findenLint, Jacobus Hendricus van, 1932-, Hrsg. Designs, graphs, codes, and their links. Cambridge: Cambridge University Press, 1991.
Den vollen Inhalt der Quelle findenMorris, Anthony Robert. Self dual codes generated by graphs. Birmingham: University of Birmingham, 1994.
Den vollen Inhalt der Quelle findenCameron, Peter J. Designs, graphs, codes and their links. Cambridge: C. U. P., 1991.
Den vollen Inhalt der Quelle finden1971-, Kim Saejoon, Hrsg. Fundamentals of codes, graphs, and iterative decoding. Boston: Kluwer Academic Publishers, 2003.
Den vollen Inhalt der Quelle findenCull, Paul. Perfect codes, NP-completeness, and towers of Hanoi graphs. Corvallis, OR: Oregon State University, Dept. of Computer Science, 1998.
Den vollen Inhalt der Quelle findenCull, Paul. Perfect codes, NP-completeness, and towers of Hanoi graphs. Corvallis, OR: Oregon State University, Dept. of Computer Science, 1998.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Graphe de code"
Johnsson, Thomas. „Target code generation from G-machine code“. In Graph Reduction, 119–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18420-1_53.
Der volle Inhalt der QuelleMohan, Anshuman, Wei Xiang Leow und Aquinas Hobor. „Functional Correctness of C Implementations of Dijkstra’s, Kruskal’s, and Prim’s Algorithms“. In Computer Aided Verification, 801–26. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_37.
Der volle Inhalt der QuelleReinders, James, Ben Ashbaugh, James Brodman, Michael Kinsner, John Pennycook und Xinmin Tian. „Where Code Executes“. In Data Parallel C++, 25–59. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5574-2_2.
Der volle Inhalt der QuelleMaitra, Deepankar. „Introduction to Graphs“. In Beginner's Guide to Code Algorithms, 101–17. New York: CRC Press, 2021. http://dx.doi.org/10.1201/9781003214335-8.
Der volle Inhalt der QuelleRódenas-López, Manuel A., Pedro M. Jiménez-Vicario und Andrea Giordano. „Poetics of Code/Code of Poetics. Generative Design Applied to ‘Arte Concreta’ Masterpieces“. In Graphic Imprints, 23–37. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-93749-6_3.
Der volle Inhalt der QuelleShokrollahi, M. Amin. „Codes and Graphs“. In STACS 2000, 1–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-46541-3_1.
Der volle Inhalt der QuelleBrouwer, Andries E., Arjeh M. Cohen und Arnold Neumaier. „Graphs Related to Codes“. In Distance-Regular Graphs, 345–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-74341-2_11.
Der volle Inhalt der QuelleKarrenberg, Ralf. „Dynamic Code Variants“. In Automatic SIMD Vectorization of SSA-based Control Flow Graphs, 127–39. Wiesbaden: Springer Fachmedien Wiesbaden, 2015. http://dx.doi.org/10.1007/978-3-658-10113-8_7.
Der volle Inhalt der QuelleDjordjevic, Ivan, William Ryan und Bane Vasic. „Graph-Based Codes“. In Coding for Optical Channels, 179–206. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-5569-2_5.
Der volle Inhalt der QuelleFay, Colin, Sébastien Rochette, Vincent Guyader und Cervan Girard. „Optimizing {shiny} Code“. In Engineering Production-Grade Shiny Apps, 267–88. Boca Raton: Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781003029878-23.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Graphe de code"
Nikolentzos, Giannis, Polykarpos Meladianos, Stratis Limnios und Michalis Vazirgiannis. „A Degeneracy Framework for Graph Similarity“. In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/360.
Der volle Inhalt der QuelleHsu, Cheng-Ho, und Kin-Tak Lam. „A Method for the Identification of Displacement Isomorphism of Planetary Gear Trains“. In ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0419.
Der volle Inhalt der QuelleSchatz, Y., und B. Domer. „Optimizing IFC-structured Data Graph for Code Compliance Checking“. In The 29th EG-ICE International Workshop on Intelligent Computing in Engineering. EG-ICE, 2022. http://dx.doi.org/10.7146/aul.455.c208.
Der volle Inhalt der QuelleZhou, Kaixiong, Qingquan Song, Xiao Huang, Daochen Zha, Na Zou und Xia Hu. „Multi-Channel Graph Neural Networks“. In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/188.
Der volle Inhalt der QuelleGupta, Rajeev, Madhusudhanan Krishnamoorthy und Vipindeep Vangala. „Better Graph Embeddings for Enterprise Graphs“. In CODS-COMAD 2024: 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD). New York, NY, USA: ACM, 2024. http://dx.doi.org/10.1145/3632410.3632412.
Der volle Inhalt der QuelleKataoka, Tetsuya, und Akihiro Inokuchi. „Hadamard Code Graph Kernels for Classifying Graphs“. In International Conference on Pattern Recognition Applications and Methods. SCITEPRESS - Science and and Technology Publications, 2016. http://dx.doi.org/10.5220/0005634700240032.
Der volle Inhalt der QuelleEl-Gayyar, M. S., H. M. El-Eashy und M. Zaki. „Structural Synthesis and Enumeration of Epicyclic Gear Mechanisms Up to 12-Links Using Acyclic Graph Method“. In ASME Turbo Expo 2006: Power for Land, Sea, and Air. ASMEDC, 2006. http://dx.doi.org/10.1115/gt2006-91136.
Der volle Inhalt der QuelleJongsma, T. J., und W. Zhang. „An Efficient Algorithm for Finding Optimum Code Under the Condition of Incident Degree“. In ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0409.
Der volle Inhalt der QuelleZhang, Yangkang, Chenye Meng, Zejian Li, Pei Chen, Guang Yang, Changyuan Yang und Lingyun Sun. „Learning Object Consistency and Interaction in Image Generation from Scene Graphs“. In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/192.
Der volle Inhalt der QuelleZhu, Hua, Hong Huang, Kehan Yin, Zejun Fan, Hai Jin und Bang Liu. „CausalNET: Unveiling Causal Structures on Event Sequences by Topology-Informed Causal Attention“. In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. California: International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/790.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Graphe de code"
Wang, Yanli, Sam Sham und Mark C. Messner. Report on FY19 Testing in Support of Grade 91 Core Block Code Case. Office of Scientific and Technical Information (OSTI), September 2019. http://dx.doi.org/10.2172/1569371.
Der volle Inhalt der QuelleShashkov, Mikhail Jurievich, und Konstantin Lipnikov. Dependency graph for code analysis on emerging architectures. Office of Scientific and Technical Information (OSTI), August 2017. http://dx.doi.org/10.2172/1374308.
Der volle Inhalt der QuelleBoutin, Debra, und Victoria Horan. Identifying Codes on Directed De Bruijn Graphs. Fort Belvoir, VA: Defense Technical Information Center, Dezember 2014. http://dx.doi.org/10.21236/ada623527.
Der volle Inhalt der QuelleTripakis, Stavros, Dai Bui, Bert Rodiers und Edward A. Lee. Compositionality in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs. Fort Belvoir, VA: Defense Technical Information Center, Oktober 2009. http://dx.doi.org/10.21236/ada538756.
Der volle Inhalt der QuelleZhai, Liangliang, und Xuanlong Ma. Perfect Codes in Proper Order Divisor Graphs of Finite Groups. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, Dezember 2020. http://dx.doi.org/10.7546/crabs.2020.12.04.
Der volle Inhalt der QuelleRickard, N. D. STRUCTURAL DESIGN CRITERIA FOR REPLACEABLE GRAPHITE CORE ELEMENTS. Office of Scientific and Technical Information (OSTI), September 1989. http://dx.doi.org/10.2172/10197186.
Der volle Inhalt der QuelleKang, Grace, Sifat Muin, Jorge Archbold, Bitanoosh Woods und Khalid Mosalam. Expected Earthquake Performance of Buildings Designed to the California Building Code. Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, Juli 2019. http://dx.doi.org/10.55461/lotg8562.
Der volle Inhalt der QuelleRobert L. Bratton und Tim D. Burchell. Status of ASME Section III Task Group on Graphite Support Core Structures. Office of Scientific and Technical Information (OSTI), August 2005. http://dx.doi.org/10.2172/911242.
Der volle Inhalt der QuelleDuffy, Stephen. Modeling Stress Strain Relationships and Predicting Failure Probabilities For Graphite Core Components. Office of Scientific and Technical Information (OSTI), September 2013. http://dx.doi.org/10.2172/1095244.
Der volle Inhalt der QuelleBOGER, R. M. Test Plan for Rotary Mode Core Sample Truck Grapple Hoist Level Wind System. Office of Scientific and Technical Information (OSTI), August 1999. http://dx.doi.org/10.2172/797723.
Der volle Inhalt der Quelle