Gotowe bibliografie tematyczne / Combinatorial circuits

Gotowa bibliografia na temat „Combinatorial circuits”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 20 lutego 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Combinatorial circuits”.

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 "Combinatorial circuits"

1

Tsuiki, Shigeya, i Takahiro Haga. "AND-inverse detecting circuit for the combinatorial logic circuits". Electronics and Communications in Japan (Part III: Fundamental Electronic Science) 73, nr 11 (1990): 51–60. http://dx.doi.org/10.1002/ecjc.4430731106.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Matsushima, Ayano, i Ann M. Graybiel. "Combinatorial Developmental Controls on Striatonigral Circuits". Cell Reports 38, nr 2 (styczeń 2022): 110272. http://dx.doi.org/10.1016/j.celrep.2021.110272.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Matsushima, Ayano, i Ann M. Graybiel. "Combinatorial Developmental Controls on Striatonigral Circuits". Cell Reports 31, nr 11 (czerwiec 2020): 107778. http://dx.doi.org/10.1016/j.celrep.2020.107778.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Donovan, Zola, Gregory Gutin, Vahan Mkrtchyan i K. Subramani. "Clustering without replication in combinatorial circuits". Journal of Combinatorial Optimization 38, nr 2 (21.02.2019): 481–501. http://dx.doi.org/10.1007/s10878-019-00394-1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Fang, K. Y., i A. S. Wojcik. "Modular decomposition of combinatorial multiple-values circuits". IEEE Transactions on Computers 37, nr 10 (1988): 1293–301. http://dx.doi.org/10.1109/12.5993.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Chen, Ethan, i Vanessa Chen. "Statistical RF/Analog Integrated Circuit Design Using Combinatorial Randomness for Hardware Security Applications". Mathematics 8, nr 5 (20.05.2020): 829. http://dx.doi.org/10.3390/math8050829.

Pełny tekst źródła
Streszczenie:
While integrated circuit technologies keep scaling aggressively, analog, mixed-signal, and radio-frequency (RF) circuits encounter challenges by creating robust designs in advanced complementary metal–oxide–semiconductor (CMOS) processes with the diminishing voltage headroom. The increasing random mismatch of smaller feature sizes in leading-edge technology nodes severely limit the benefits of scaling for (RF)/analog circuits. This paper describes the details of the combinatorial randomness by statistically selecting device elements that relies on the significant growth in subsets number of combinations. The randomness can be utilized to provide post-manufacturing reconfiguration of the selectable circuit elements to achieve required specifications for ultra-low-power systems. The calibration methodology is demonstrated with an ultra-low-voltage chaos-based true random number generator (TRNG) for energy-constrained Internet of things (IoT) devices in the secure communications.
Style APA, Harvard, Vancouver, ISO itp.
7

URAHAMA, KIICHI, i SHIN-ICHIRO UENO. "A GRADIENT SYSTEM SOLUTION TO POTTS MEAN FIELD EQUATIONS AND ITS ELECTRONIC IMPLEMENTATION". International Journal of Neural Systems 04, nr 01 (marzec 1993): 27–34. http://dx.doi.org/10.1142/s0129065793000043.

Pełny tekst źródła
Streszczenie:
A gradient system solution method is presented for solving Potts mean field equations for combinatorial optimization problems subject to winner-take-all constraints. In the proposed solution method the optimum solution is searched by using gradient descent differential equations whose trajectory is confined within the feasible solution space of optimization problems. This gradient system is proven theoretically to always produce a legal local optimum solution of combinatorial optimization problems. An elementary analog electronic circuit implementing the presented method is designed on the basis of current-mode subthreshold MOS technologies. The core constituent of the circuit is the winner-take-all circuit developed by Lazzaro et al. Correct functioning of the presented circuit is exemplified with simulations of the circuits implementing the scheme for solving the shortest path problems.
Style APA, Harvard, Vancouver, ISO itp.
8

Wróblewski, Artur, Christian V. Schimpfle, Otto Schumacher i Josef A. Nossek. "Minimizing Spurious Switching Activities with Transistor Sizing". VLSI Design 15, nr 2 (1.01.2002): 537–45. http://dx.doi.org/10.1080/1065514021000012156.

Pełny tekst źródła
Streszczenie:
In combinatorial blocks of static CMOS circuits transistor sizing can be applied for delay balancing as to guarantee synchronously arriving signal slopes at the input of logic gates, thereby avoiding glitches. Since the delay of logic gates depends directly on transistor sizes, their variation allows equalizing different path delays without influencing the total delay of the circuit. Unfortunately, not only the delay, but also power consumption circuits depend on the transistor sizes. To achieve optimal results, transistor lengths have to be increased, which results in both increased gate capacitances and area. Splitting the long transistors counteracts this negative influence.
Style APA, Harvard, Vancouver, ISO itp.
9

Zhu, Enqiang, Congzhou Chen, Yongsheng Rao i Weicheng Xiong. "Biochemical Logic Circuits Based on DNA Combinatorial Displacement". IEEE Access 8 (2020): 34096–103. http://dx.doi.org/10.1109/access.2020.2974024.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Fujiwara, Yuichiro, i Charles J. Colbourn. "A Combinatorial Approach to X-Tolerant Compaction Circuits". IEEE Transactions on Information Theory 56, nr 7 (lipiec 2010): 3196–206. http://dx.doi.org/10.1109/tit.2010.2048468.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Combinatorial circuits"

1

Agnihotri, Ameya Ramesh. "Combinatorial optimization techniques for VLSI placement". Diss., Online access via UMI:, 2007.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Cox, Robert Sidney Sternberg Paul W. Sternberg Paul W. "Transcriptional regulation and combinatorial genetic logic in synthetic bacterial circuits /". Diss., Pasadena, Calif. : California Institute of Technology, 2008. http://resolver.caltech.edu/CaltechETD:etd-03042008-130011.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Rinderknecht, William John. "A power reduction algorithm for combinatorial CMOS circuits using input disabling". Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/36543.

Pełny tekst źródła
Streszczenie:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
Includes bibliographical references (p. 61-62).
by William John Rinderknecht.
M.S.
Style APA, Harvard, Vancouver, ISO itp.
4

Hacker, Charles Hilton, i n/a. "WinLogiLab - A Computer-Based Teaching Suite for Digital Logic Design". Griffith University. School of Engineering, 2001. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20050915.172404.

Pełny tekst źródła
Streszczenie:
This thesis presents an interactive computerised teaching suite developed for the design of combinatorial and sequential logic circuits. This suite fills a perceived gap in the currently available computer-based teaching software for digital logic design. Several existing digital logic educational software are available, however these existing programs were found to be unsuitable for our use in providing alternative mode subject delivery. This prompted the development of a Microsoft Windows TM tutorial suite, called WinLogiLab. WinLogiLab comprises of a set of tutorials that uses student provided input data, to perform the initial design steps for digital Combinatorial and Sequential logic circuits. The combinatorial tutorials are designed to show the link between Boolean Algebra and Digital Logic circuits, and follows the initial design steps: from Boolean algebra, truth tables, to Exact and the Heuristic minimisation techniques, to finally produce the combinatorial circuit. Similarly, the sequential tutorials can design simple State Machine Counters, and can model more complex Finite State Automata.
Style APA, Harvard, Vancouver, ISO itp.
5

Hacker, Charles. "WinLogiLab - A Computer-Based Teaching Suite for Digital Logic Design". Thesis, Griffith University, 2001. http://hdl.handle.net/10072/367209.

Pełny tekst źródła
Streszczenie:
This thesis presents an interactive computerised teaching suite developed for the design of combinatorial and sequential logic circuits. This suite fills a perceived gap in the currently available computer-based teaching software for digital logic design. Several existing digital logic educational software are available, however these existing programs were found to be unsuitable for our use in providing alternative mode subject delivery. This prompted the development of a Microsoft Windows TM tutorial suite, called WinLogiLab. WinLogiLab comprises of a set of tutorials that uses student provided input data, to perform the initial design steps for digital Combinatorial and Sequential logic circuits. The combinatorial tutorials are designed to show the link between Boolean Algebra and Digital Logic circuits, and follows the initial design steps: from Boolean algebra, truth tables, to Exact and the Heuristic minimisation techniques, to finally produce the combinatorial circuit. Similarly, the sequential tutorials can design simple State Machine Counters, and can model more complex Finite State Automata.
Thesis (Masters)
Master of Philosophy (MPhil)
School of Engineering
Science, Environment, Engineering and Technology
Full Text
Style APA, Harvard, Vancouver, ISO itp.
6

Coward, Bob. "Genroute : a genetic algorithm (printed wire board (PWB) router) /". Online version of thesis, 1991. http://hdl.handle.net/1850/10711.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Duran, Arqué Berta. "Combinatorial perspective on the gene expression circuits established by the CPEB-family of RNA binding proteins". Doctoral thesis, Universitat de Barcelona, 2020. http://hdl.handle.net/10803/673591.

Pełny tekst źródła
Streszczenie:
The complex changes that take place in the mature Xenopus oocyte and early embryo are orchestrated in the absence of transcription. Until zygotic transcription starts, after the mid-blastula transition, cells rely on tight spatiotemporal translational regulation. Some maternal mRNAs accumulate during oocyte growth and are stored, translationally silent. Upon stimuli, stored, silenced mRNAs become cytoplasmically polyadenylated and, subsequently, engage in translation. The timing and extent of translational activation are dictated by a complex code of 3’UTR motifs recognized by RNA-binding proteins. In meiotic maturation, at least three sequential polyadenylation waves occur. First, in response to progesterone, a single Aurora kinase A phosphorylation triggers CPEB1-directed cytoplasmic polyadenylation of mRNAs that are required for Cdk1 activation and meiotic progression. Second, activated Cdk1 targets CPEB1 for degradation, triggering a second polyadenylation surge that is necessary for the MI-MII transition. Last, CPEB4, synthesized from the first wave and activated by Cdk1 and ERK2 upon meiotic progression, drives a third wave during the second meiotic division that is required for the metaphase-II arrest. Unlike the well-studied roles of CPEB1 and CPEB4, the roles of the remaining family members, CPEB2 and CPEB3, remain uncharacterized. In this thesis we have performed a systematic investigation of the CPEB-family of RBPs in meiotic maturation in order to elucidate their combinatorial contribution to gene expression regulation. We have determined that CPEB1 and the CPEB2-4 subfamily differ in their expression dynamics, concentration and regulation. Like CPEB4, CPEB2 and CPEB3 are regulated by N-terminal hyperphosphorylation that causes dissolution of the CPEB-condensates. Furthermore, we have found that all CPEBs co-localize and are proximal to mRNA repression and storage proteins, probably reflecting their inclusion within large repressive mRNPs in the oocyte. We have also found that all CPEBs bind a highly overlapping subset of mRNAs, although CPEB1 and CPEB2-4 could differentially regulate a small subset of targets. All in all, we have contributed to the understanding of how the multiple CPEBs co-exist and how their activities are coordinated in the cell to dictate complex expression patterns.
La maduración meiótica y la embriogénesis temprana de Xenopus se dan en ausencia de transcripción. Hasta la transición materno-cigótica – después de la 12ª división embrionaria - la transcripción no se re-inicia y todos los cambios en expresión génica ocurren por mecanismos post- transcripcionales, entre los cuales destaca la poliadenilación citoplasmática. Durante su crecimiento, el oocito produce grandes cantidades de mRNA que mantiene silenciados, con una cola de poly(A) corta. En la maduración y embriogénesis, ciertos mRNAs son poliadenilados y traducidos. Cuando y cuanto cada mRNA es movilizado depende de la combinación de señales presentes en su 3’UTR y de las proteínas de unión al RNA que las reconocen. En la maduración meiótica se dan, al menos, tres olas secuenciales de poliadenilación. La primera es iniciada en respuesta a progesterona. Concretamente, la fosforilación por Aurora quinasa A causa la remodelación del complejo de represión de CPEB1 a complejo de activación, permitiendo la expresión de genes necesarios para la progresión meiótica, como Cdk1. Seguidamente, Cdk1 participa en la degradación de CPEB1 generando una segunda ola que es necesaria para la interkinesis. Por último, CPEB4, producida en la primera ola de poliadenilación y activada por fosforilación por Cdk1 abandera una tercera ola que posibilita la expresión de proteínas que mantienen el arresto en metafase-II. A diferencia de sus homólogos CPEB1 y CPEB4, los papeles de CPEB2 y CPEB3 en maduración meiótica siguen sin caracterizar. Por ello y para entender como esta familia de proteínas de unión al RNA se coordina para dictar la expresión génica hemos realizado una investigación sistemática y comparativa de las CPEBs en maduración meiótica.
Style APA, Harvard, Vancouver, ISO itp.
8

Goulart, Sobrinho Edilton Furquim [UNESP]. "Uma ferramenta alternativa para síntese de circuitos lógicos usando a técnica de circuito evolutivo". Universidade Estadual Paulista (UNESP), 2007. http://hdl.handle.net/11449/87253.

Pełny tekst źródła
Streszczenie:
Made available in DSpace on 2014-06-11T19:22:35Z (GMT). No. of bitstreams: 0 Previous issue date: 2007-05-25Bitstream added on 2014-06-13T20:49:18Z : No. of bitstreams: 1 goulartsobrinho_ef_me_ilha.pdf: 944900 bytes, checksum: 47dc5d964428b7cb8bd18e1e00e1d994 (MD5)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Neste trabalho descreve-se uma metodologia para síntese e otimização de circuitos digitais, usando a teoria de algoritmos evolutivos e como plataforma os dispositivos reconfiguráveis, denominada Hardware Evolutivo do inglês- Evolvable Hardware - EHW. O EHW, tornou-se viável com o desenvolvimento em grande escala dos dispositivos reconfiguráveis, Programmable Logic Devices (PLD s), cuja arquitetura e função podem ser determinadas por programação. Cada circuito pode ser representado como um indivíduo em um processo evolucionário, evoluindo-o através de operações genéticas para um resultado desejado. Como algoritmo evolutivo, aplicou-se o Algoritmo Genético (AG), uma das técnicas da computação evolutiva que utiliza os conceitos da genética e seleção natural. O processo de síntese aplicado neste trabalho, inicia por uma descrição do comportamento do circuito, através de uma tabela verdade para circuitos combinacionais e a tabela de estados para os circuitos seqüenciais. A técnica aplicada busca o arranjo correto e minimizado do circuito que desempenhe uma função proposta. Com base nesta metodologia, são implementados alguns exemplos em duas diferentes representações (mapas de fusíveis e matriz de portas lógicas).
In this work was described a methodology for optimization and synthesis of digital circuits, which consist of evolving circuits through evolvable algorithms using as platforms reconfigurable devices, denominated Evolvable Hardware (EHW). It was became viable with the large scale development of reconfigurable devices, whose architecture and function can be determined by programming. Each circuit can be represented as an individual within an evolutionary process, evolving through genetic operations to desire results. Genetic Algorithm (GA) was applied as evolutionary algorithm where this technique evolvable computation as concepts of genetics and natural selection. The synthesis process applied in this work starts from a description from the circuits behavior. Trust table for combinatorial circuits and state transition table for sequential circuits were used for synthesis process. This technic applied search the correct arrange and minimized circuit which response the propose function. Based on this methodology, some examples are implemented in two different representations (fuse maps and logic gate matrices).
Style APA, Harvard, Vancouver, ISO itp.
9

Nafkha, Amor. "A geometrical approach detector for solving the combinatorial optimisation problem : application in wireless communication systems". Lorient, 2006. http://www.theses.fr/2006LORIS067.

Pełny tekst źródła
Streszczenie:
Cette thèse s'intéresse à la résolution du problème classique de décodage d'un mélange linéaire entaché d'un bruit additif gaussien. A partir d'une observation bruitée: y = Hx+b, d'un vecteur d'entiers x mélangé linéairement par une matrice H connue, b étant un vecteur de bruit, on cherche le vecteur x minimisant la distance Euclidienne entre y et le vecteur Hx. Ce problème est réputé NP-complet. Il intervient dans un grand nombre de systèmes de télécommunications (MIMO, MC-CDMA, etc. ). Nous proposons dans cette thèse un algorithme de résolution quasi optimal de ce problème et bien adapté à une implémentation matérielle. Notre démarche s'appuie sur l'utilisation des méthodes classiques de recherche opérationnelle : trouver des points initiaux répartis sur l'espace des solutions possibles et potentiellement proches de la solution optimale (diversification) et effectuer une recherche locale au voisinage des ces points (intensification). Dans ce travail, la diversification est basée sur une approche géométrique utilisant les axes dominants de concentration du bruit. Les performances en terme de taux d'erreur par bit de la méthode proposée sont proches de l'optimum tout en gardant une complexité constante et un degré de parallélisme important. Nous avons étendu cette méthode à la constellation MAQ-16 d'une part, et à la génération d'une décision souple d'autre part. Nous avons étudié l'algorithme proposé du point de vue implémentation matérielle. L'algorithme proposé présente d'une part une nouvelle alternative pour le décodage quasi optimal du mélange bruité et d'autre part un important degré de parallélisme permettant une implémentation efficace
The demand for mobile communication systems with high data rates and improved link quality for a variety of applications has dramatically increased in recent years. New concepts and methods are necessary in order to cover this huge demand, which counteract or take advantage of the impairments of the mobile communication channel and optimally exploit the limited resources such as bandwidth and power. The problem of finding the least-squares solution to a system of linear equations where the unknown vector is comprised of integers, but the matrix coefficients and given vector are comprised of real numbers, arise in many applications: communications, cryptography, MC-CDMA, MIMO, to name a few. The Maximum Likelihood (ML) decoding is equivalent to finding the closest lattice point in an n-dimensional real space. In general, this problem is known to be non deterministic NP hard. In this thesis, a polynomial-time approximation method called Geometrical Intersection and Selection Detector (GISD) is applied to the MLD problem. Moreover, the proposed approach is based on two complementary "real time" operational research methods: intensification and diversification. Our approach has three important characteristics that make it very attractive for for VLSI implementation. First, It will be shown that the performance of GISD receiver is superior as compared to other sub-optimal detection methods and it provides a good approximation to the optimal detector. Second, the inherent parallel structure of the proposed method leads to a very suitable hardware implementation. Finaly, The GISD allows a near optimal performance with constant polynomial-time, O(n3), computational complexity (unlike the sphere decoding that has exponential-time complexity for low SNR). The proposed Detector can be efficiently employed in most wireless communications systems: MIMO, MC-CDMA, MIMO-CDMA etc. .
Style APA, Harvard, Vancouver, ISO itp.
10

Goulart, Sobrinho Edilton Furquim. "Uma ferramenta alternativa para síntese de circuitos lógicos usando a técnica de circuito evolutivo /". Ilha Solteira : [s.n.], 2007. http://hdl.handle.net/11449/87253.

Pełny tekst źródła
Streszczenie:
Orientador: Suely Cunha Amaro Mantovani
Banca: José Raimundo de Oliveira
Banca: Nobuo Oki
Resumo: Neste trabalho descreve-se uma metodologia para síntese e otimização de circuitos digitais, usando a teoria de algoritmos evolutivos e como plataforma os dispositivos reconfiguráveis, denominada Hardware Evolutivo do inglês- Evolvable Hardware - EHW. O EHW, tornou-se viável com o desenvolvimento em grande escala dos dispositivos reconfiguráveis, Programmable Logic Devices (PLD’s), cuja arquitetura e função podem ser determinadas por programação. Cada circuito pode ser representado como um indivíduo em um processo evolucionário, evoluindo-o através de operações genéticas para um resultado desejado. Como algoritmo evolutivo, aplicou-se o Algoritmo Genético (AG), uma das técnicas da computação evolutiva que utiliza os conceitos da genética e seleção natural. O processo de síntese aplicado neste trabalho, inicia por uma descrição do comportamento do circuito, através de uma tabela verdade para circuitos combinacionais e a tabela de estados para os circuitos seqüenciais. A técnica aplicada busca o arranjo correto e minimizado do circuito que desempenhe uma função proposta. Com base nesta metodologia, são implementados alguns exemplos em duas diferentes representações (mapas de fusíveis e matriz de portas lógicas).
Abstract: In this work was described a methodology for optimization and synthesis of digital circuits, which consist of evolving circuits through evolvable algorithms using as platforms reconfigurable devices, denominated Evolvable Hardware (EHW). It was became viable with the large scale development of reconfigurable devices, whose architecture and function can be determined by programming. Each circuit can be represented as an individual within an evolutionary process, evolving through genetic operations to desire results. Genetic Algorithm (GA) was applied as evolutionary algorithm where this technique evolvable computation as concepts of genetics and natural selection. The synthesis process applied in this work starts from a description from the circuits behavior. Trust table for combinatorial circuits and state transition table for sequential circuits were used for synthesis process. This technic applied search the correct arrange and minimized circuit which response the propose function. Based on this methodology, some examples are implemented in two different representations (fuse maps and logic gate matrices).
Mestre
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Combinatorial circuits"

1

Lengauer, T. Combinatorial algorithms for integrated circuit layout. Stuttgart: B.G. Teubner, 1990.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Lengauer, Thomas. Combinatorial algorithms for integrated circuit layout. Chichester: Wiley, 1990.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Engineering genetic circuits. Boca Raton: Chapman & Hall/CRC, 2010.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Lengauer, Thomas. Combinatorial Algorithms for Integrated Circuit Layout. Wiesbaden: Vieweg+Teubner Verlag, 1990. http://dx.doi.org/10.1007/978-3-322-92106-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Lengauer, T. Combinatorial Algorithms for Integrated Circuit Layout. Wiesbaden: Vieweg+Teubner Verlag, 1992.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

International Conference on Microreaction Technology (1st 1997). Microreaction technology: Proceedings of the First International Conference on Microreaction Technology. Berlin: Springer, 1998.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Braun, Jaromír. Kombinatorické metody v analýze a modelování elektronických soustav. Praha: Academia, 1990.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Barg, Alexander, i O. R. Musin. Discrete geometry and algebraic combinatorics. Providence, Rhode Island: American Mathematical Society, 2014.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Myasnikov, Alexei G. Non-commutative cryptography and complexity of group-theoretic problems. Providence, R.I: American Mathematical Society, 2011.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Morse, Robert Fitzgerald, editor of compilation, Nikolova-Popova, Daniela, 1952- editor of compilation i Witherspoon, Sarah J., 1966- editor of compilation, red. Group theory, combinatorics and computing: International Conference in honor of Daniela Nikolova-Popova's 60th birthday on Group Theory, Combinatorics and Computing, October 3-8, 2012, Florida Atlantic University, Boca Raton, Florida. Providence, Rhode Island: American Mathematical Society, 2013.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Combinatorial circuits"

1

Tietze, Ulrich, Christoph Schenk i Eberhard Gamm. "Combinatorial Circuits". W Electronic Circuits, 635–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-78655-9_8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Adam, Hans-Joachim, i Mathias Adam. "Combinatorial Circuits with PLC". W PLC Programming In Instruction List According To IEC 61131-3, 69–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 2022. http://dx.doi.org/10.1007/978-3-662-65254-1_5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Donovan, Zola, K. Subramani i Vahan Mkrtchyan. "Disjoint Clustering in Combinatorial Circuits". W Lecture Notes in Computer Science, 201–13. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-25005-8_17.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Groote, Jan Friso, Rolf Morel, Julien Schmaltz i Adam Watkins. "Basic components and combinatorial circuits". W Logic Gates, Circuits, Processors, Compilers and Computers, 1–22. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68553-9_1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Mankowski, Michal, i Mikhail Moshkov. "Circuits and Cost Functions". W Dynamic Programming Multi-Objective Combinatorial Optimization, 17–27. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-63920-4_2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Donovan, Zola, Vahan Mkrtchyan i K. Subramani. "On Clustering Without Replication in Combinatorial Circuits". W Combinatorial Optimization and Applications, 334–47. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26626-8_25.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Ellis, Samuel J., Titus H. Klinge i James I. Lathrop. "Robust Combinatorial Circuits in Chemical Reaction Networks". W Theory and Practice of Natural Computing, 178–89. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71069-3_14.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Hoory, Shlomo, Avner Magen i Toniann Pitassi. "Monotone Circuits for the Majority Function". W Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 410–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11830924_38.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Gupta, Meenakshi, Vikram Kumar Kamboj i R. K. Sharma. "A novel hybrid GWO-PS based solution approach for combinatorial unit commitment problem". W Intelligent Circuits and Systems, 417–24. London: CRC Press, 2021. http://dx.doi.org/10.1201/9781003129103-65.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Klivans, Adam R. "On the Derandomization of Constant Depth Circuits". W Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 249–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44666-4_28.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Combinatorial circuits"

1

Wirth, Gilson I., Michele G. Vieira, Egas Henes Neto i F. G. L. Kastensmidt. "Single event transients in combinatorial circuits". W the 18th annual symposium. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1081081.1081115.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Wirth, Gilson I., Michele G. Vieira, Egas Henes Neto i F. G. L. Kastensmidt. "Single Event Transients in Combinatorial Circuits". W 2005 18th Symposium on Integrated Circuits and Systems Design. IEEE, 2005. http://dx.doi.org/10.1109/sbcci.2005.4286843.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Kiselyov, Oleg, Kedar N. Swadi i Walid Taha. "A methodology for generating verified combinatorial circuits". W the fourth ACM international conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1017753.1017794.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Serlet, B. P. "Fast, small, and static combinatorial CMOS circuits". W 24th ACM/IEEE conference proceedings. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/37888.37955.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Strukov, Dmitri. "Solving Combinatorial Optimization Problems with Nanoelectronic Neuromorphic Circuits". W Neuromorphic Materials, Devices, Circuits and Systems. València: FUNDACIO DE LA COMUNITAT VALENCIANA SCITO, 2023. http://dx.doi.org/10.29363/nanoge.neumatdecas.2023.006.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Oraon, Neha, i Madhav Rao. "Delay approximation for nanomagnetic logic based combinatorial circuits". W 2019 IEEE 14th International Conference on Nano/Micro Engineered and Molecular Systems (NEMS). IEEE, 2019. http://dx.doi.org/10.1109/nems.2019.8915607.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Srivastava, Atul K., i Hariom Gupta. "Cluster growth technique for combinatorial evolvable digital circuits". W 2014 Seventh International Conference on Contemporary Computing (IC3). IEEE, 2014. http://dx.doi.org/10.1109/ic3.2014.6897189.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Guindi, R. S. "Gate-leakage estimation and minimization in CMOS combinatorial circuits". W Proceedings of the 15th International Conference on Microelectronics. IEEE, 2003. http://dx.doi.org/10.1109/icm.2003.238361.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Kechichian, Al-Khalili i Al-Khalili. "Optimizing CMOS combinatorial circuits using multiple attribute decision making techniques". W Proceedings of Canadian Conference on Electrical and Computer Engineering CCECE-94. IEEE, 1994. http://dx.doi.org/10.1109/ccece.1994.405810.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Kitamichi, J., H. Kageyama i N. Funabiki. "Formal verification method for combinatorial circuits at high level design". W Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198). IEEE, 1999. http://dx.doi.org/10.1109/aspdac.1999.760023.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Combinatorial circuits” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii