Littérature scientifique sur le sujet « Prime implicants »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Prime implicants ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Prime implicants"
Prasad, V. C. « Quality of Minimal Sets of Prime Implicants of Boolean Functions ». International Journal of Electronics and Telecommunications 63, no 2 (27 juin 2017) : 165–69. http://dx.doi.org/10.1515/eletel-2017-0022.
Texte intégralBienvenu, M. « Prime Implicates and Prime Implicants : From Propositional to Modal Logic ». Journal of Artificial Intelligence Research 36 (20 octobre 2009) : 71–128. http://dx.doi.org/10.1613/jair.2754.
Texte intégralKean, Alex, et George Tsiknis. « An incremental method for generating prime implicants/implicates ». Journal of Symbolic Computation 9, no 2 (février 1990) : 185–206. http://dx.doi.org/10.1016/s0747-7171(08)80029-6.
Texte intégralQi, Guilin, et Kewen Wang. « Conflict-Based Belief Revision Operators in Possibilistic Logic ». Proceedings of the AAAI Conference on Artificial Intelligence 26, no 1 (20 septembre 2021) : 800–806. http://dx.doi.org/10.1609/aaai.v26i1.8226.
Texte intégralAl-Wardi, Zaid, et Osama Al-Wardi. « RECURSIVE TERNARY-BASED ALGORITHM FOR COMPUTING PRIME IMPLICANTS OF MULTI-OUTPUT BOOLEAN FUNCTIONS ». Journal of Engineering and Sustainable Development 27, no 3 (1 mai 2023) : 308–16. http://dx.doi.org/10.31272/jeasd.27.3.2.
Texte intégralSingh, Arindama. « Computing prime implicants via transversal clauses ». International Journal of Computer Mathematics 70, no 3 (janvier 1999) : 417–27. http://dx.doi.org/10.1080/00207169908804764.
Texte intégralTyrväinen, Tero. « Prime implicants in dynamic reliability analysis ». Reliability Engineering & ; System Safety 146 (février 2016) : 39–46. http://dx.doi.org/10.1016/j.ress.2015.10.007.
Texte intégralČepek, Ondřej, Petr Kučera et Stanislav Kuřík. « Boolean functions with long prime implicants ». Information Processing Letters 113, no 19-21 (septembre 2013) : 698–703. http://dx.doi.org/10.1016/j.ipl.2013.07.001.
Texte intégralAudemard, Gilles, Steve Bellart, Louènas Bounia, Frédéric Koriche, Jean-Marie Lagniez et Pierre Marquis. « Trading Complexity for Sparsity in Random Forest Explanations ». Proceedings of the AAAI Conference on Artificial Intelligence 36, no 5 (28 juin 2022) : 5461–69. http://dx.doi.org/10.1609/aaai.v36i5.20484.
Texte intégralMichalak, Marcin. « Searching for Continuous n-Clusters with Boolean Reasoning ». Symmetry 16, no 10 (1 octobre 2024) : 1286. http://dx.doi.org/10.3390/sym16101286.
Texte intégralThèses sur le sujet "Prime implicants"
Sanches, Aline de Paula [UNESP]. « Emprego do método de Quine-Mccluskey estendido para gerar circuito mínimo com estruturas ESOP (XOR-XNOR) ». Universidade Estadual Paulista (UNESP), 2017. http://hdl.handle.net/11449/151311.
Texte intégralApproved for entry into archive by LUIZA DE MENEZES ROMANETTO (luizamenezes@reitoria.unesp.br) on 2017-08-15T17:07:06Z (GMT) No. of bitstreams: 1 sanches_ap_me_ilha.pdf: 2013568 bytes, checksum: ca3ff36ff336a306c7f01255c8eebee4 (MD5)
Made available in DSpace on 2017-08-15T17:07:06Z (GMT). No. of bitstreams: 1 sanches_ap_me_ilha.pdf: 2013568 bytes, checksum: ca3ff36ff336a306c7f01255c8eebee4 (MD5) Previous issue date: 2017-07-06
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Com a disseminação de dispositivos eletrônicos cada vez menores e o advento de novas tecnologias. A busca por métodos de minimização de funções booleanas tem sido a base para eletrônica digital. Neste trabalho apresenta-se a implementação da primeira fase do método Quine-McCluskey Estendido que utiliza-se de estruturas AND-XOR-XNOR para a geração de implicantes primos. O objetivo do trabalho foi comprovar que, na maioria das vezes, a implementação de uma função Booleana utilizando expressões AND-XOR-XNOR requerem menor quantidade de termos produtos, quando comparado com implementação com expressões AND-OR. A fase de cobertura dos mintermos em ambos os métodos foi formulada como um problema de programação linear inteira 0 e 1 que através do programa Lp_solve obteve a solução de menor custo. Na comparação da eficiência dos métodos foram analisados os custos dos circuitos mínimos gerados, a quantidade de memória utilizada e o tempo de execução. Com os resultados obtidos pode-se concluir que, para a maioria dos casos executados, o método Quine-McCluskey Estendido gera uma solução de menor custo. No entanto, com relação ao desempenho computacional (tempo de execução e memória), o método Quine-McCluskey Estendido apresentou-se inferior se comparado ao Quine-McCluskey.
With the dissemination of smaller and smaller electronic devices and the advent of new technologies. The search for methods of minimizing Boolean function has been the basis for digital electronics. This work presents the implementation of the first phase of the Extended Quine-McCluskey method, which uses AND-XOR-XNOR structures to generate prime implicants. The goal of this work is to prove that, in most cases, the implementation of a Boolean function using the expressions AND-XOR-XNOR requires fewer product terms than the implementation with AND-OR expressions does. The stage of mini terms covering in both methods was formulated with the 0-1 integer linear programming problem, which obtained lower cost through the Lp_Solve program. While comparing the efficiency of these methods we analised: the costs of the minimum circuits generated, the amount of memory that has been used and the runtime. With the obtained results it is possible to conclude that, for most of the executed cases, the Extended Quine-McCluskey method generates a solution of lower cost. On the other hand, with regards to the computational performance (runtime and memory), the Extended Quine-McCluskey method has shown itself inferior when compared to the Quine-McCluskey method.
Sanches, Aline de Paula. « Emprego do método de Quine-Mccluskey estendido para gerar circuito mínimo com estruturas ESOP (XOR-XNOR) / ». Ilha Solteira, 2017. http://hdl.handle.net/11449/151311.
Texte intégralResumo: Com a disseminação de dispositivos eletrônicos cada vez menores e o advento de novas tecnologias. A busca por métodos de minimização de funções booleanas tem sido a base para eletrônica digital. Neste trabalho apresenta-se a implementação da primeira fase do método Quine-McCluskey Estendido que utiliza-se de estruturas AND-XOR-XNOR para a geração de implicantes primos. O objetivo do trabalho foi comprovar que, na maioria das vezes, a implementação de uma função Booleana utilizando expressões AND-XOR-XNOR requerem menor quantidade de termos produtos, quando comparado com implementação com expressões AND-OR. A fase de cobertura dos mintermos em ambos os métodos foi formulada como um problema de programação linear inteira 0 e 1 que através do programa Lp_solve obteve a solução de menor custo. Na comparação da eficiência dos métodos foram analisados os custos dos circuitos mínimos gerados, a quantidade de memória utilizada e o tempo de execução. Com os resultados obtidos pode-se concluir que, para a maioria dos casos executados, o método Quine-McCluskey Estendido gera uma solução de menor custo. No entanto, com relação ao desempenho computacional (tempo de execução e memória), o método Quine-McCluskey Estendido apresentou-se inferior se comparado ao Quine-McCluskey.
Mestre
Elliott, Paul Harrison 1979. « An efficient projected minimal conflict generator for projected prime implicate and implicant generation ». Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17766.
Texte intégralIncludes bibliographical references (p. 109-111).
Performing real-time reasoning on models of physical systems is essential in many situations, especially when human intervention is impossible. Since many deductive reasoning tasks take memory or time that is exponential in the number of variables that appear in the model, efforts need to be made to reduce the size of the models used online. The model can be reduced without sacrificing reasoning ability by targeting the model for a specific task, such as diagnosis or reconfiguration. A model may be reduced through model compilation, an offline process where relations and variables that have no bearing on the particular task are removed. This thesis introduces a novel approach to model compilation, through the generation of projected prime implicates and projected prime implicants. Prime implicates and prime implicants compactly represent the consequences of a logical theory. Projection eliminates model variables and their associated prime implicates or implicants that do not contribute to the particular task. This elimination process reduces the size and number of variables appearing in the model and therefore the complexity of the real-time reasoning problem. This thesis presents a minimal conflict generator that efficiently generates projected prime implicates and projected prime implicants. The projected minimal conflict generator uses a generate-and-test approach, in which the candidate generator finds potential minimal conflicts that are then accepted or rejected by the candidate tester. The candidate generator uses systematic search in combination with an iterative deepening algorithm, in order to reduce the space required by the algorithm to a space that is linear in the number of variables rather than exponential.
(cont.) In order to make the algorithm more time efficient, the candidate generator prunes the search space using previously found implicants, as well as minimal conflicts, which identify the sub-spaces that contain no new minimal conflicts. The candidate tester identifies implicants of the model by testing for validity. The tester uses a clause-directed approach along with finite-domain variables to efficiently test for validity. Combined, these techniques allow the tester to test for validity without assigning a value to every variable. The conflict generator was evaluated on randomly generated models; problems in which models with 20 variables, 5 domain elements each, were projected onto 5 variables. All projected prime implicates were generated from models with 20 clauses within 2 seconds, and from models with 80 clauses within 13 seconds.
by Paul Harrison Elliott.
S.M.
Franciscani, Juliana de Fátima [UNESP]. « Consenso Iterativo : geração de implicantes primos para minimização de funções booleanas com múltiplas saídas ». Universidade Estadual Paulista (UNESP), 2016. http://hdl.handle.net/11449/144517.
Texte intégralApproved for entry into archive by Felipe Augusto Arakaki (arakaki@reitoria.unesp.br) on 2016-11-03T19:07:45Z (GMT) No. of bitstreams: 1 franciscani_jf_me_ilha.pdf: 3638504 bytes, checksum: 6ca7f15a8be8ef019afd3f8e0ecc1e52 (MD5)
Made available in DSpace on 2016-11-03T19:07:45Z (GMT). No. of bitstreams: 1 franciscani_jf_me_ilha.pdf: 3638504 bytes, checksum: 6ca7f15a8be8ef019afd3f8e0ecc1e52 (MD5) Previous issue date: 2016-08-31
Com a evolução e difusão do desenvolvimento de equipamentos utilizando microtecnologia e nanotecnologia, circuitos cada vez menores, mais eficientes e que consomem menos energia, são necessários. Os métodos de minimização de funções booleanas tornam-se relevantes por possibilitarem a otimização de circuitos lógicos, através da geração de circuitos que possuam a mesma funcionalidade, porém, minimizados. Estudos na área de minimização de funções booleanas são realizados há muito tempo, e estão sendo adaptados às novas tecnologias. A geração de implicantes primos de uma função booleana é um dos passos para a cobertura dos mintermos da função e, consequentemente, para a obtenção da função de custo mínimo. Neste trabalho, a Primeira Fase do Método de Quine-McCluskey para Funções Booleanas com Múltiplas Saídas (QMM) foi implementada para posterior comparação com os Métodos Propostos GPMultiplo e MultiGeraPlex (baseados na filosofia do algoritmo GeraPlex). Os métodos propostos geram os implicantes primos de uma função booleana com múltiplas saídas e utilizam a operação de consenso iterativo para comparar dois termos. Os resultados obtidos, através da comparação do GPMultiplo, MultiGeraPlex e da Primeira Fase do Método de QMM, puderam comprovar que a aplicação dos métodos propostos torna-se mais viável e vantajosa por permitir menor tempo de execução e uso de memória, menor quantidade de implicantes gerados e de comparações entre os termos.
With the evolution and spread of the development of equipment using microtechnology and nanotechnology, circuits in need are smaller, more efficient and consume less power. Methods of Minimizing Boolean Functions become important as they allow optimization of logic circuits by generating circuits having the same functionality, but minimized. Studies in Minimizing Boolean Functions area are carried out long ago, and are being adapted to new technologies. The generation of prime implicants of a Boolean function is one of the steps for covering the function of the minterms, and consequently to obtain the minimum cost function. In this work, the first phase of the Quine-McCluskey Method for Booleans Functions with Multiple Output (QMM) was implemented for comparison with Proposed Methods GPMultiplo and MultiGeraPlex (based on the philosophy of GeraPlex algorithm). The proposed methods generates the prime implicants of a Boolean Function with Multiple Output and using the iterative consensus operation to compare two terms. The results obtained by comparing the GPMultiplo, MultiGeraPlex and the first phase of the QMM Method, were able to prove that the application of the proposed methods becomes more feasible and advantageous, by allowing smaller execution time, number of implicants and number of comparisons.
Franciscani, Juliana de Fátima. « Consenso Iterativo : geração de implicantes primos para minimização de funções booleanas com múltiplas saídas / ». Ilha Solteira, 2016. http://hdl.handle.net/11449/144517.
Texte intégralResumo: Com a evolução e difusão do desenvolvimento de equipamentos utilizando microtecnologia e nanotecnologia, circuitos cada vez menores, mais eficientes e que consomem menos energia, são necessários. Os métodos de minimização de funções booleanas tornam-se relevantes por possibilitarem a otimização de circuitos lógicos, através da geração de circuitos que possuam a mesma funcionalidade, porém, minimizados. Estudos na área de minimização de funções booleanas são realizados há muito tempo, e estão sendo adaptados às novas tecnologias. A geração de implicantes primos de uma função booleana é um dos passos para a cobertura dos mintermos da função e, consequentemente, para a obtenção da função de custo mínimo. Neste trabalho, a Primeira Fase do Método de Quine-McCluskey para Funções Booleanas com Múltiplas Saídas (QMM) foi implementada para posterior comparação com os Métodos Propostos GPMultiplo e MultiGeraPlex (baseados na filosofia do algoritmo GeraPlex). Os métodos propostos geram os implicantes primos de uma função booleana com múltiplas saídas e utilizam a operação de consenso iterativo para comparar dois termos. Os resultados obtidos, através da comparação do GPMultiplo, MultiGeraPlex e da Primeira Fase do Método de QMM, puderam comprovar que a aplicação dos métodos propostos torna-se mais viável e vantajosa por permitir menor tempo de execução e uso de memória, menor quantidade de implicantes gerados e de comparações entre os termos.
Mestre
Tourret, Sophie. « Prime implicate generation in equational logic ». Thesis, Université Grenoble Alpes (ComUE), 2016. http://www.theses.fr/2016GREAM006/document.
Texte intégralThe work presented in this memoir deals with the generation of prime implicates in ground equational logic, i.e., of the most general consequences of formulae containing equations and disequations between ground terms.It is divided in three parts. First, two calculi that generate implicates are defined. Their deductive-completeness is proved, meaning they can both generate all the implicates up to redundancy of equational formulae.Second, a tree data structure to store the generated implicates is proposed along with algorithms to detect redundancies and prune the branches of the tree accordingly. This data structure is adapted to the different kinds of clauses (with and without function symbols, with and without constraints) and to the various formal definitions of redundancy used in the calculi since each calculus uses different -- although similar -- redundancy criteria. Termination and correction proofs are provided with each algorithm. Finally, an experimental evaluation of the different prime implicate generation methods based on research prototypes written in Ocaml is conducted including a comparison with state-of-the-art prime implicate generation tools. This experimental study is used to identify the most efficient variants of the proposed algorithms. These show promising results overstepping the state of the art
Willot, Hénoïk. « Certified explanations of robust models ». Electronic Thesis or Diss., Compiègne, 2024. http://www.theses.fr/2024COMP2812.
Texte intégralWith the advent of automated or semi-automated decision systems in artificial intelligence comes the need of making them more reliable and transparent for an end-user. While the role of explainable methods is in general to increase transparency, reliability can be achieved by providing certified explanations, in the sense that those are guaranteed to be true, and by considering robust models that can abstain when having insufficient information, rather than enforcing precision for the mere sake of avoiding indecision. This last aspect is commonly referred to as skeptical inference. This work participates to this effort, by considering two cases: - The first one considers classical decision rules used to enforce fairness, which are the Ordered Weighted Averaging (OWA) with decreasing weights. Our main contribution is to fully characterise from an axiomatic perspective convex sets of such rules, and to provide together with this sound and complete explanation schemes that can be efficiently obtained through heuristics. Doing so, we also provide a unifying framework between the restricted and generalized Lorenz dominance, two qualitative criteria, and precise decreasing OWA. - The second one considers that our decision rule is a classification model resulting from a learning procedure, where the resulting model is a set of probabilities. We study and discuss the problem of providing prime implicant as explanations in such a case, where in addition to explaining clear preferences of one class over the other, we also have to treat the problem of declaring two classes as being incomparable. We describe the corresponding problems in general ways, before studying in more details the robust counter-part of the Naive Bayes Classifier
PETRINI, Maria Celeste. « IL MARKETING INTERNAZIONALE DI UN ACCESSORIO-MODA IN MATERIALE PLASTICO ECO-COMPATIBILE : ASPETTI ECONOMICI E PROFILI GIURIDICI. UN PROGETTO PER LUCIANI LAB ». Doctoral thesis, 2018. http://hdl.handle.net/11393/251084.
Texte intégralLivres sur le sujet "Prime implicants"
Miras Rodríguez, María del Mar, et Silvia Martelo Landróguez. BusinesScape : buscando la implicación y motivación del alumnado. Servicio de Recursos Audiovisuales y Nuevas Tecnologías US, 2024. http://dx.doi.org/10.35466/vid2024n7965.
Texte intégralMartínez Portilla, Isabel M. El refugio como escuela : experiencias organizativas de las mujeres guatemaltecas en México. Universidad Internacional de Andalucía, 2001. http://dx.doi.org/10.56451/10334/3795.
Texte intégralCórdova Calle, Elia Anacely, Rony Flores Ramírez et Teresa del Pilar López Sánchez. Regulación pública en turismo. Universidad Nacional de San Martín - Fondo Editorial, 2022. http://dx.doi.org/10.51252/4414.
Texte intégralTorres Molina, Ramón, et María Verónica Piccone, dir. Democracia y dictadura. Editorial de la Universidad Nacional de La Plata (EDULP), 2017. http://dx.doi.org/10.35537/10915/61418.
Texte intégralSerrano, Juan. Contra el poder. Alberto Donadío y el periodismo de investigación. Sílaba Editores y Ediciones Uniandes, 2019. http://dx.doi.org/10.51566/ceper2117_30.
Texte intégralSánchez Vázquez, María José. Ética, responsabilidad científica e investigación psicológica. Editorial de la Universidad Nacional de La Plata (EDULP), 2018. http://dx.doi.org/10.35537/10915/65521.
Texte intégralHoward, Colin R. Arenaviruses. Oxford University Press, 2011. http://dx.doi.org/10.1093/med/9780198570028.003.0032.
Texte intégralHernández, Carlos. Principios, ponderación y pretensión de corrección en el constitucionalismo discursivo de Robert Alexy. Universidad Libre sede principal, 2017. http://dx.doi.org/10.18041/978-958-8981-64-2.
Texte intégralChapitres de livres sur le sujet "Prime implicants"
Villa, Tiziano, Timothy Kam, Robert K. Brayton et Alberto Sangiovanni-Vincentelli. « Generalized Prime Implicants ». Dans Synthesis of Finite State Machines, 221–43. Boston, MA : Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6155-2_7.
Texte intégralJackson, Peter, et John Pais. « Computing prime implicants ». Dans 10th International Conference on Automated Deduction, 543–57. Berlin, Heidelberg : Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/3-540-52885-7_113.
Texte intégralKettle, Neil, Andy King et Tadeusz Strzemecki. « Widening ROBDDs with Prime Implicants ». Dans Tools and Algorithms for the Construction and Analysis of Systems, 105–19. Berlin, Heidelberg : Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11691372_7.
Texte intégralRamesh, Anavai, et Neil V. Murray. « Non-clausal deductive techniques for computing prime implicants and prime implicates ». Dans Logic Programming and Automated Reasoning, 277–88. Berlin, Heidelberg : Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-56944-8_60.
Texte intégralPirri, Fiora, et Clara Pizzuti. « Characterizing prime implicants as projective spaces ». Dans Advances in Artificial Intelligence, 41–46. Berlin, Heidelberg : Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57292-9_40.
Texte intégralWillot, Hénoïk, Sébastien Destercke et Khaled Belahcene. « Explaining Robust Classification Through Prime Implicants ». Dans Lecture Notes in Computer Science, 361–69. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-18843-5_25.
Texte intégralHartmann, Uwe. « From Prime Implicants to Modular Feedforward Networks ». Dans Artificial Neural Nets and Genetic Algorithms, 172–75. Vienna : Springer Vienna, 1995. http://dx.doi.org/10.1007/978-3-7091-7535-4_46.
Texte intégralSalhi, Yakoub. « Approaches for Enumerating All the Essential Prime Implicants ». Dans Artificial Intelligence : Methodology, Systems, and Applications, 228–39. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99344-7_21.
Texte intégralJabbour, Said, Joao Marques-Silva, Lakhdar Sais et Yakoub Salhi. « Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form ». Dans Logics in Artificial Intelligence, 152–65. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11558-0_11.
Texte intégralHayase, Kazuyoshi, et Hiroshi Imai. « OBDDs of a monotone function and of its prime implicants ». Dans Algorithms and Computation, 136–45. Berlin, Heidelberg : Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0009489.
Texte intégralActes de conférences sur le sujet "Prime implicants"
Deharbe, David, Pascal Fontaine, Daniel Le Berre et Bertrand Mazure. « Computing prime implicants ». Dans 2013 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 2013. http://dx.doi.org/10.1109/fmcad.2013.6679390.
Texte intégralDas, Sunil R., Abdullah-Al Amin, Satyendra N. Biswas, Mansour H. Assaf, Emil M. Petriu et Voicu Groza. « An algorithm for generating prime implicants ». Dans 2016 IEEE International Instrumentation and Measurement Technology Conference (I2MTC). IEEE, 2016. http://dx.doi.org/10.1109/i2mtc.2016.7520355.
Texte intégralde Colnet, Alexis, et Pierre Marquis. « On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits ». Dans Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California : International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/358.
Texte intégralRosenbaum, David J., et Marek A. Perkowski. « Superposed Quantum State Initialization Using Disjoint Prime Implicants (SQUID) ». Dans 2008 38th International Symposium on Multiple Valued Logic (ismvl 2008). IEEE, 2008. http://dx.doi.org/10.1109/ismvl.2008.24.
Texte intégralLu, Peng, et James N. Siddall. « Nonlinear Programming Using Logic Methods ». Dans ASME 1991 Design Technical Conferences. American Society of Mechanical Engineers, 1991. http://dx.doi.org/10.1115/detc1991-0066.
Texte intégralDevadoss, Rajeswari, Kolin Paul et M. Balakrishnan. « Majority Logic : Prime Implicants and n-Input Majority Term Equivalence ». Dans 2019 32nd International Conference on VLSI Design and 2019 18th International Conference on Embedded Systems (VLSID). IEEE, 2019. http://dx.doi.org/10.1109/vlsid.2019.00098.
Texte intégralShevked, Zekie, et Ludmil Dakovski. « Learning and classification with prime implicants applied to medical data diagnosis ». Dans the 2007 international conference. New York, New York, USA : ACM Press, 2007. http://dx.doi.org/10.1145/1330598.1330708.
Texte intégralQiu, Jianlin, Xiang Gu, Dan Ji, Fen Li, Peng He et Bo Wang. « Logic functions minimization algorithm based on recognition of essential prime implicants ». Dans 2010 Sixth International Conference on Natural Computation (ICNC). IEEE, 2010. http://dx.doi.org/10.1109/icnc.2010.5583819.
Texte intégralMados, B., Z. Bilanova, E. Chovancova et N. Adam. « Field Programmable Gate Array Hardware Accelerator of Prime Implicants Generation for Single-Output Boolean Functions Minimization ». Dans 2019 17th International Conference on Emerging eLearning Technologies and Applications (ICETA). IEEE, 2019. http://dx.doi.org/10.1109/iceta48886.2019.9040020.
Texte intégralBasciftci, Fatih, et Sirzat Kahramanli. « An Off-Cubes Expanding Approach to the Problem of Separate Determination of the Essential Prime Implicants of the Single-Output Boolean Functions ». Dans EUROCON 2007 - The International Conference on "Computer as a Tool". IEEE, 2007. http://dx.doi.org/10.1109/eurcon.2007.4400396.
Texte intégralRapports d'organisations sur le sujet "Prime implicants"
Tirumalai, Parthasarathy P., et Jon T. Butler. Prime and Non-Prime Implicants in the Minimization of Multiple-Valued Logic Functions. Fort Belvoir, VA : Defense Technical Information Center, janvier 1989. http://dx.doi.org/10.21236/ada605375.
Texte intégralDionicio, Viviana, Edwin Mayorga, Jairo Andrés Valcárcel Torres, Marta Lucía Calvache, Mónica Arcila Rivera, Fernando Díaz, Ruth Emilse Bolaños et al. Primer Foro Internacional de Redes Sismológicas, Amenaza Sísmica y Gestión del Riesgo de Desastres. Servicio Geológico Colombiano, août 2021. http://dx.doi.org/10.32685/28056302.
Texte intégralMacías Fernández, Arturo Pablo, et Ignacio de la Peña Leal. Sensibilidad a los tipos de interés soberanos de la cartera de colateral elegible para los préstamos de política monetaria. Madrid : Banco de España, mai 2024. http://dx.doi.org/10.53479/36612.
Texte intégralAbusamra, Valeria, María de los Ángeles Chimenti, Micaela Difalcis et Tamara Vinacur. Lectura y escritura en los primeros años de la escuela primaria : una sistematización de experiencias de evaluación de la alfabetización inicial en el contexto iberoamericano. Inter-American Development Bank, octobre 2024. http://dx.doi.org/10.18235/0013220.
Texte intégral