Gotowa bibliografia na temat „Automaton inference”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Automaton inference”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Automaton inference"
Richetin, M., i M. Naranjo. "Inference of Automata by dialectic learning". Robotica 3, nr 3 (wrzesień 1985): 159–63. http://dx.doi.org/10.1017/s0263574700009085.
Pełny tekst źródłaHÖGBERG, JOHANNA. "A randomised inference algorithm for regular tree languages". Natural Language Engineering 17, nr 2 (21.03.2011): 203–19. http://dx.doi.org/10.1017/s1351324911000064.
Pełny tekst źródłaWieczorek, Wojciech, Tomasz Jastrzab i Olgierd Unold. "Answer Set Programming for Regular Inference". Applied Sciences 10, nr 21 (30.10.2020): 7700. http://dx.doi.org/10.3390/app10217700.
Pełny tekst źródłaGrachev, Petr, Sergey Muravyov, Andrey Filchenkov i Anatoly Shalyto. "Automata generation based on recurrent neural networks and automated cauterization selection". Information and Control Systems, nr 1 (19.02.2020): 34–43. http://dx.doi.org/10.31799/1684-8853-2020-1-34-43.
Pełny tekst źródłaTopper, Noah, George Atia, Ashutosh Trivedi i Alvaro Velasquez. "Active Grammatical Inference for Non-Markovian Planning". Proceedings of the International Conference on Automated Planning and Scheduling 32 (13.06.2022): 647–51. http://dx.doi.org/10.1609/icaps.v32i1.19853.
Pełny tekst źródłaDi, Chong, Fangqi Li, Shenghong Li i Jianwei Tian. "Bayesian inference based learning automaton scheme in Q-model environments". Applied Intelligence 51, nr 10 (10.03.2021): 7453–68. http://dx.doi.org/10.1007/s10489-021-02230-8.
Pełny tekst źródłaCHTOUROU, MOHAMED, MAHER BEN JEMAA i RAOUF KETATA. "A learning-automaton-based method for fuzzy inference system identification". International Journal of Systems Science 28, nr 9 (lipiec 1997): 889–96. http://dx.doi.org/10.1080/00207729708929451.
Pełny tekst źródłaSenthil Kumar, K., i D. Malathi. "Context Free Grammar Identification from Positive Samples". International Journal of Engineering & Technology 7, nr 3.12 (20.07.2018): 1096. http://dx.doi.org/10.14419/ijet.v7i3.12.17768.
Pełny tekst źródłaKosala, Raymond, Hendrik Blockeel, Maurice Bruynooghe i Jan Van den Bussche. "Information extraction from structured documents using k-testable tree automaton inference". Data & Knowledge Engineering 58, nr 2 (sierpień 2006): 129–58. http://dx.doi.org/10.1016/j.datak.2005.05.002.
Pełny tekst źródłaTîrnăucă, Cristina. "A Survey of State Merging Strategies for DFA Identification in the Limit". Triangle, nr 8 (29.06.2018): 121. http://dx.doi.org/10.17345/triangle8.121-136.
Pełny tekst źródłaRozprawy doktorskie na temat "Automaton inference"
Ansin, Rasmus, i Didrik Lundberg. "Automated Inference of Excitable Cell Models as Hybrid Automata". Thesis, KTH, Skolan för teknikvetenskap (SCI), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-154065.
Pełny tekst źródłaI denna uppsats undersöker vi från en experimentell synvinkel möjligheter och begränsningar i den nya inlärningsalgoritmen HYCGE för hybridautomater. Som ett exempel på en praktisk tillämpning, studerar vi algoritmens förmåga att lära sig aktionspotentialens beteende i retbara celler, specifikt Hodgkin-Huxleymodellen av en bläckfisks jätteaxon, Luo-Rudymodellen av en ventrikulärcell i marsvin, och Entchevas modell av en ventrikulär cell i nyfödd råtta .Giltigheten och noggrannheten hos algoritmen visualiseras även genom grafiskamedel.
Rasoamanana, Aina Toky. "Derivation and Analysis of Cryptographic Protocol Implementation". Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAS005.
Pełny tekst źródłaTLS and SSH are two well-known and thoroughly studied security protocols. In this thesis, we focus on a specific class of vulnerabilities affecting both protocols implementations, state machine errors. These vulnerabilities are caused by differences in interpreting the standard and correspond to deviations from the specifications, e.g. accepting invalid messages, or accepting valid messages out of sequence.We develop a generalized and systematic methodology to infer the protocol state machines such as the major TLS and SSH stacks from stimuli and observations, and to study their evolution across revisions. We use the L* algorithm to compute state machines corresponding to different execution scenarios.We reproduce several known vulnerabilities (denial of service, authentication bypasses), and uncover new ones. We also show that state machine inference is efficient and practical enough in many cases for integration within a continuous integration pipeline, to help find new vulnerabilities or deviations introduced during development.With our systematic black-box approach, we study over 600 different versions of server and client implementations in various scenarios (protocol versions, options). Using the resulting state machines, we propose a robust algorithm to fingerprint TLS and SSH stacks. To the best of our knowledge, this is the first application of this approach on such a broad perimeter, in terms of number of TLS and SSH stacks, revisions, or execution scenarios studied
Gransden, Thomas Glenn. "Automating proofs with state machine inference". Thesis, University of Leicester, 2017. http://hdl.handle.net/2381/40814.
Pełny tekst źródłaPaige, Timothy Brooks. "Automatic inference for higher-order probabilistic programs". Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:d912c4de-4b08-4729-aa19-766413735e2a.
Pełny tekst źródłaMERINO, JORGE SALVADOR PAREDES. "AUTOMATIC SYNTHESIS OF FUZZY INFERENCE SYSTEMS FOR CLASSIFICATION". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2015. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=27007@1.
Pełny tekst źródłaCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
PROGRAMA DE EXCELENCIA ACADEMICA
Hoje em dia, grande parte do conhecimento acumulado está armazenado em forma de dados. Para muitos problemas de classificação, tenta-se aprender a relação entre um conjunto de variáveis (atributos) e uma variável alvo de interesse. Dentre as ferramentas capazes de atuar como modelos representativos de sistemas reais, os Sistemas de Inferência Fuzzy são considerados excelentes com respeito à representação do conhecimento de forma compreensível, por serem baseados em regras linguísticas. Este quesito de interpretabilidade linguística é relevante em várias aplicações em que não se deseja apenas um modelo do tipo caixa preta, que, por mais precisão que proporcione, não fornece uma explicação de como os resultados são obtidos. Esta dissertação aborda o desenvolvimento de um Sistema de Inferência Fuzzy de forma automática, buscando uma base de regras que valorize a interpretabilidade linguística e que, ao mesmo tempo, forneça uma boa acurácia. Para tanto, é proposto o modelo AutoFIS-Class, um método automático para a geração de Sistemas de Inferência Fuzzy para problemas de classificação. As características do modelo são: (i) geração de premissas que garantam critérios mínimos de qualidade, (ii) associação de cada premissa a um termo consequente mais compatível e (iii) agregação de regras de uma mesma classe por meio de operadores que ponderem a influência de cada regra. O modelo proposto é avaliado em 45 bases de dados benchmark e seus resultados são comparados com modelos da literatura baseados em Algoritmos Evolucionários. Os resultados comprovam que o Sistema de Inferência gerado é competitivo, apresentando uma boa acurácia com um baixo número de regras.
Nowadays, much of the accumulated knowledge is stored as data. In many classification problems the relationship between a set of variables (attributes) and a target variable of interest must be learned. Among the tools capable of modeling real systems, Fuzzy Inference Systems are considered excellent with respect to the knowledge representation in a comprehensible way, as they are based on inference rules. This is relevant in applications where a black box model does not suffice. This model may attain good accuracy, but does not explain how results are obtained. This dissertation presents the development of a Fuzzy Inference System in an automatic manner, where the rule base should favour linguistic interpretability and at the same time provide good accuracy. In this sense, this work proposes the AutoFIS-Class model, an automatic method for generating Fuzzy Inference Systems for classification problems. Its main features are: (i) generation of premises to ensure minimum, quality criteria, (ii) association of each rule premise to the most compatible consequent term; and (iii) aggregation of rules for each class through operator that weigh the relevance of each rule. The proposed model was evaluated for 45 datasets and their results were compared to existing models based on Evolutionary Algorithms. Results show that the proposed Fuzzy Inference System is competitive, presenting good accuracy with a low number of rules.
Rainforth, Thomas William Gamlen. "Automating inference, learning, and design using probabilistic programming". Thesis, University of Oxford, 2017. http://ora.ox.ac.uk/objects/uuid:e276f3b4-ff1d-44bf-9d67-013f68ce81f0.
Pełny tekst źródłaDixon, Heidi. "Automating pseudo-Boolean inference within a DPLL framework /". view abstract or download file of text, 2004. http://wwwlib.umi.com/cr/uoregon/fullcit?p3153782.
Pełny tekst źródłaTypescript. Includes vita and abstract. Includes bibliographical references (leaves 140-146). Also available for download via the World Wide Web; free to University of Oregon users.
MacNish, Craig Gordon. "Nonmonotonic inference systems for modelling dynamic processes". Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.240195.
Pełny tekst źródłaLin, Ye. "Internet data extraction based on automatic regular expression inference". [Ames, Iowa : Iowa State University], 2007.
Znajdź pełny tekst źródłaEl, Kaliouby Rana Ayman. "Mind-reading machines : automated inference of complex mental states". Thesis, University of Cambridge, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.615030.
Pełny tekst źródłaKsiążki na temat "Automaton inference"
Lee, Won Don. Probabilistic inference. Urbana, Ill: Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1986.
Znajdź pełny tekst źródłaLee, Won Don. Probabilistic inference: Theory and practice. Urbana, Ill: Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1986.
Znajdź pełny tekst źródłaauthor, Kohlas Jürg 1939, red. Generic Inference: A Unifying Theory for Automated Reasoning. Hoboken, New Jersey: Wiley, 2011.
Znajdź pełny tekst źródłaFarreny, Henri. AI and expertise: Heuristic search, inference engines, automatic proving. Chichester: E. Horwood, 1989.
Znajdź pełny tekst źródłaVarlamov, Oleg. Fundamentals of creating MIVAR expert systems. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1513119.
Pełny tekst źródłaVarlamov, Oleg. Mivar databases and rules. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1508665.
Pełny tekst źródłaHiguera, Colin De La. Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, 2010.
Znajdź pełny tekst źródłaHiguera, Colin de la. Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, 2010.
Znajdź pełny tekst źródłaHiguera, Colin de la. Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, 2014.
Znajdź pełny tekst źródłaHiguera, Colin de la. Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, 2010.
Znajdź pełny tekst źródłaCzęści książek na temat "Automaton inference"
Dupont, Pierre, i Lin Chase. "Using symbol clustering to improve probabilistic automaton inference". W Grammatical Inference, 232–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0054079.
Pełny tekst źródłaFiroiu, Laura, Tim Oates i Paul R. Cohen. "Learning a deterministic finite automaton with a recurrent neural network". W Grammatical Inference, 90–101. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0054067.
Pełny tekst źródłaXu, Zhe, Bo Wu, Aditya Ojha, Daniel Neider i Ufuk Topcu. "Active Finite Reward Automaton Inference and Reinforcement Learning Using Queries and Counterexamples". W Lecture Notes in Computer Science, 115–35. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-84060-0_8.
Pełny tekst źródłaYang, Hui, Yue Ma i Nicole Bidoit. "Hypergraph-Based Inference Rules for Computing $$\mathcal{EL}\mathcal{}^+$$-Ontology Justifications". W Automated Reasoning, 310–28. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10769-6_19.
Pełny tekst źródłaNewborn, Monty. "Inference Procedures". W Automated Theorem Proving, 29–42. New York, NY: Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4613-0089-2_4.
Pełny tekst źródłaBhayat, Ahmed, Johannes Schoisswohl i Michael Rawson. "Superposition with Delayed Unification". W Automated Deduction – CADE 29, 23–40. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38499-8_2.
Pełny tekst źródłade la Higuera, Colin. "Learning stochastic finite automata from experts". W Grammatical Inference, 79–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0054066.
Pełny tekst źródłaViechnicki, Peter. "A performance evaluation of automatic survey classifiers". W Grammatical Inference, 244–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0054080.
Pełny tekst źródłaStickel, Mark E. "PTTP and Linked Inference". W Automated Reasoning Series, 283–95. Dordrecht: Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-011-3488-0_14.
Pełny tekst źródłaStachniak, Zbigniew. "Nonmonotonic Resolution Inference Systems". W Automated Reasoning Series, 165–78. Dordrecht: Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-009-1677-7_8.
Pełny tekst źródłaStreszczenia konferencji na temat "Automaton inference"
Zhaohua, Huang, i Yang Fan. "Information Extraction from Web Documents Based on Unranked Tree Automaton Inference". W 2012 4th International Conference on Multimedia Information Networking and Security (MINES). IEEE, 2012. http://dx.doi.org/10.1109/mines.2012.128.
Pełny tekst źródłaGrantner, Janos L., Sean T. Fuller i Jozsef Dombi. "Fuzzy automaton model with adaptive inference mechanism for intelligent decision support systems". W 2016 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2016. http://dx.doi.org/10.1109/fuzz-ieee.2016.7737991.
Pełny tekst źródłaSaika, Yohei, Shouta Akiyama i Hiroki Sakaematsu. "Bayesian inference in optical measurement due to remote sensing to synthetic aperture radar interferometry". W 2013 13th International Conference on Control, Automaton and Systems (ICCAS). IEEE, 2013. http://dx.doi.org/10.1109/iccas.2013.6704157.
Pełny tekst źródłaAsami, Atsushi, Tatsuki Yamada i Yohei Saika. "Probabilistic inference of environmental factors via time series analysis using mean-field theory of ising model". W 2013 13th International Conference on Control, Automaton and Systems (ICCAS). IEEE, 2013. http://dx.doi.org/10.1109/iccas.2013.6704168.
Pełny tekst źródłaXu, Zhe, i Ufuk Topcu. "Transfer of Temporal Logic Formulas in Reinforcement Learning". W Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/557.
Pełny tekst źródłaBhoyar, A., S. Sharma, S. Barve i R. Kumar Rana. "Intelligent Control of Autonomous Vessels: Bayesian Estimation Instead of Statistical Learning?" W International Conference on Marine Engineering and Technology Oman. London: IMarEST, 2019. http://dx.doi.org/10.24868/icmet.oman.2019.008.
Pełny tekst źródłaPastore, Fabrizio, Daniela Micucci i Leonardo Mariani. "Timed k-Tail: Automatic Inference of Timed Automata". W 2017 IEEE International Conference on Software Testing, Verification and Validation (ICST). IEEE, 2017. http://dx.doi.org/10.1109/icst.2017.43.
Pełny tekst źródłaByrne, Ruth M. J. "Good Explanations in Explainable Artificial Intelligence (XAI): Evidence from Human Explanatory Reasoning". W 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/733.
Pełny tekst źródłaDeb, Sankha, i Kalyan Ghosh. "Artificial Intelligence Based Inference Techniques for Automated Process Planning for Machined Parts". W ASME 2002 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2002. http://dx.doi.org/10.1115/detc2002/cie-34507.
Pełny tekst źródłaEichhoff, Julian R., Felix Baumann i Dieter Roller. "Two Approaches to the Induction of Graph-Rewriting Rules for Function-Based Design Synthesis". W ASME 2016 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/detc2016-59915.
Pełny tekst źródłaRaporty organizacyjne na temat "Automaton inference"
Baader, Franz, Jan Hladik i Rafael Peñaloza. PSpace Automata with Blocking for Description Logics. Aachen University of Technology, 2006. http://dx.doi.org/10.25368/2022.157.
Pełny tekst źródłaBaader, Franz, i Benjamin Zarrieß. Verification of Golog Programs over Description Logic Actions. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.198.
Pełny tekst źródłaBaader, Franz, Oliver Fernández Gil i Maximilian Pensel. Standard and Non-Standard Inferences in the Description Logic FL₀ Using Tree Automata. Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.240.
Pełny tekst źródłaBrown, Frank M. Automatic Inference in Quantified Computational Logic. Fort Belvoir, VA: Defense Technical Information Center, październik 1988. http://dx.doi.org/10.21236/ada200909.
Pełny tekst źródłaVidea, Aldo, i Yiyi Wang. Inference of Transit Passenger Counts and Waiting Time Using Wi-Fi Signals. Western Transportation Institute, sierpień 2021. http://dx.doi.org/10.15788/1715288737.
Pełny tekst źródłade Kemp, E. A., H. A. J. Russell, B. Brodaric, D. B. Snyder, M. J. Hillier, M. St-Onge, C. Harrison i in. Initiating transformative geoscience practice at the Geological Survey of Canada: Canada in 3D. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/331097.
Pełny tekst źródłade Kemp, E. A., H. A. J. Russell, B. Brodaric, D. B. Snyder, M. J. Hillier, M. St-Onge, C. Harrison i in. Initiating transformative geoscience practice at the Geological Survey of Canada: Canada in 3D. Natural Resources Canada/CMSS/Information Management, 2023. http://dx.doi.org/10.4095/331871.
Pełny tekst źródłaBurstein, Jill, Geoffrey LaFlair, Antony Kunnan i Alina von Davier. A Theoretical Assessment Ecosystem for a Digital-First Assessment - The Duolingo English Test. Duolingo, marzec 2022. http://dx.doi.org/10.46999/kiqf4328.
Pełny tekst źródłaPaule, Bernard, Flourentzos Flourentzou, Tristan de KERCHOVE d’EXAERDE, Julien BOUTILLIER i Nicolo Ferrari. PRELUDE Roadmap for Building Renovation: set of rules for renovation actions to optimize building energy performance. Department of the Built Environment, 2023. http://dx.doi.org/10.54337/aau541614638.
Pełny tekst źródłaDeep learning for individual heterogeneity: an automatic inference framework. Cemmap, lipiec 2021. http://dx.doi.org/10.47004/wp.cem.2021.2921.
Pełny tekst źródła