Filters








6,407 Hits in 5.3 sec

Synthesis of low-power asynchronous circuits in a specified environment

Steven M. Nowick, Michael Theobald
1997 Proceedings of the 1997 international symposium on Low power electronics and design - ISLPED '97  
The method includes two steps: (i) an exact algorithm for 2-level synthesis, and (ii) heuristic algorithms for multi-level synthesis.  ...  We introduce a new method for the synthesis of poweroptimal asynchronous control circuits.  ...  An outline of our synthesis path for a function f and a specified environment P;Tis as follows: 1. Exact two-level hazard-free logic minimization targeting low-power consumption; 2.  ... 
doi:10.1145/263272.263291 dblp:conf/islped/NowickT97 fatcat:oep5h7562zf3do5br7fkk2n5fu

Page 880 of Mathematical Reviews Vol. , Issue 80B [page]

1980 Mathematical Reviews  
The first part has to do with incompletely specified fune- tions. Properties are given of “don’t care” implicants which can be usefully added or omitted.  ...  For fanout-free func- tions, recursive formulas for Ty p(n) [Pyp(n)], the number of n-p- n-equivalence classes of n-variable functions [p-equivalence classes of n-variable functions] are derived.  ... 

Page 257 of Automation and Remote Control Vol. 20, Issue 2 [page]

1959 Automation and Remote Control  
Harris, "An algorithm for determining minimal representation of a logic function,” Trans, IRE EC-6, 2, 103 (1957). L.  ...  Huffman, "The design and use of hazard-free switching networks,” J. Assoc. Comput, Machinery 4, 1, 47-62 (1957). A, E.  ... 

Page 3130 of Mathematical Reviews Vol. 58, Issue 4 [page]

1979 Mathematical Reviews  
Incomplete specified functions can also be treated.  ...  Emphasis is placed on illustrations of the use of the map for graphical minimization and decomposition of fuzzy switching functions.” {For the entire collection see MR 57 #15772.}  ... 

Page 1977 of Mathematical Reviews Vol. 56, Issue 5 [page]

1978 Mathematical Reviews  
Kella, Jehuda 15224 State minimization of incompletely specified sequential machines. IEEE Trans. Computers C-19 (1970), no. 4, 342-348.  ...  Karnaugh, The map method for synthesis of combinational logic circuits (pp. 25-36); E. J. McCluskey, Minimization of Boolean functions (pp. 37-57); George H.  ... 

Global optimization, level set dynamics, incomplete sensitivity and regularity control

B. Mohammadi
2007 International journal of computational fluid dynamics (Print)  
Hence, the direction of descent is found as a solution of a one-dimensional minimization problem.  ...  We aim to optimize aerodynamic shapes using an incomplete sensitivity concept and regularization (projection) when control parameters are characteristic functions as in level set and immersed boundary  ...  Hascoet and the INRIA Tapenade team for having made available to us Tapenade AD tool.  ... 
doi:10.1080/10618560701455855 fatcat:5na4euuqobhf7bh4oi4utaveay

Page 381 of Mathematical Reviews Vol. 52, Issue 1 [page]

1976 Mathematical Reviews  
It is based on the transformation of this problem to the vertex colouring prob- lem of nonoriented graphs. This enables one to find the hazard free code of minimal length.”  ...  For example, the function describing the connectivity of the pattern of 1’s in an nxn Boolean matrix grows nonlinearly in n?.  ... 

Decomposition and technology mapping of speed-independent circuits using Boolean relations

Cortadella, Kishinevsky, Kondratyev, Lavagno, Pastor, Yakovlev
1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD) ICCAD-97  
An initial circuit implementation is obtained in the form of a netlist of complex gates, which may not be available in the design library.  ...  To extract functions for H 1 and H 2 the method uses Boolean relations as opposed to the less powerful algebraic factorization approach used in previous methods.  ...  For an incompletely specified function with a DCset, let us define the DC function such that . We will say that a function is an implementation of if .  ... 
doi:10.1109/iccad.1997.643524 dblp:conf/iccad/CortadellaKKLPY97 fatcat:raiglr7zlnbipk4w4chlxbmzuu

Decomposition and technology mapping of speed-independent circuits using Boolean relations

J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, E. Pastor, A. Yakovlev
1999 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
An initial circuit implementation is obtained in the form of a netlist of complex gates, which may not be available in the design library.  ...  To extract functions for H 1 and H 2 the method uses Boolean relations as opposed to the less powerful algebraic factorization approach used in previous methods.  ...  For an incompletely specified function with a DCset, let us define the DC function such that . We will say that a function is an implementation of if .  ... 
doi:10.1109/43.784116 fatcat:yokjh4lqh5f4rdpnspzns6acni

Page 1735 of Mathematical Reviews Vol. 51, Issue 5 [page]

1976 Mathematical Reviews  
Wagner on the determination of prime conjunctions of incompletely specified Boolean functions (Elektron. Informationsverarbeit.  ...  The author is specifically concerned with hazard- free operations.  ... 

Sibling-substitution-based BDD minimization using don't cares

Youpyo Hong, P.A. Beerel, J.R. Burch, K.L. McMillan
2000 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
This paper presents heuristic algorithms to minimize the size of the BDD's representing incompletely specified functions by intelligently assigning don't cares to binary values.  ...  These algorithms are particularly useful for synthesis application where the structure of the hardware/software is derived from the BDD representation of the function to implement because the minimization  ...  Drechsler of the Albert-Ludwigs-University Freiburg for valuable discussions and feedback on an earlier version of this work.  ... 
doi:10.1109/43.822619 fatcat:e73jj4u7hjgl3eicxlyze3mhti

Computer Society Repository

1972 Computer  
The uses of Bayes Sequential Compound decision functions are investigated for contextual recognition of patterns generated by a stationary Markov chain.  ...  These bounds are nonparametric and simple functions of: (i) the differences between the a priori and transition probabilities, (ii) those between the distributions of the measurements, and (iii) the number  ...  This paper applies group theoretic techniques to the problem of detecting symmetry of various kinds in completely and incompletely specified switching functions.  ... 
doi:10.1109/c-m.1972.216869 fatcat:zekabhp6arg2pbyussiekgppm4

Abstracts of Current Computer Literature

1969 IEEE transactions on computers  
A necessary and sufficient condition for hazard-free realization of a flow table containing noncritical races is given, and it is shown that a hazard-free realization is always possible. 2) DIGITAL COMPUTERS  ...  Minimization State Minimization and Minimal Dynamics for Algebra Automata 6349 Minimization of the Number of Pins in an Electronic Package 6369 Minimization of Error in Character Recognition 6401 -see  ... 
doi:10.1109/t-c.1969.222537 fatcat:yogv2lr73be65iqipqwh3bmem4

Architecting Safety Supervisors for High Levels of Automated Driving

Martin Torngren, Xinhai Zhang, Naveen Mohan, Matthias Becker, Lars Svensson, Xin Tao, De-Jiu Chen, Jonas Westman
2018 2018 21st International Conference on Intelligent Transportation Systems (ITSC)  
Focusing on the architecting of an Autonomous Driving Intelligence (ADI), i.e. the computational intelligence, sensors and communication needed for high levels of automated driving, we investigate so called  ...  We then discuss the sources of hazardous events, the division of responsibilities among the channels, and when the supervisor should take over. We conclude with identified directions for further work.  ...  An "ODD" specifies the "conditions under which a given driving automation system or feature thereof is designed to function, including, but not limited to, driving modes", [1] ; an ODD may thus e.g. specify  ... 
doi:10.1109/itsc.2018.8569945 dblp:conf/itsc/TorngrenZM0STCW18 fatcat:y6hg6jdk35fjnh2ndrvj5m3ljm

Balancing New against Old Information: The Role of Puzzlement Surprise in Learning

Mohammadjavad Faraji, Kerstin Preuschoff, Wulfram Gerstner
2018 Neural Computation  
Surprise describes a range of phenomena from unexpected events to behavioral responses. We propose a novel measure of surprise and use it for surprise-driven learning.  ...  Our surprise-minimizing framework is suitable for learning in complex environments, even if the environment undergoes gradual or sudden changes, and it could eventually provide a framework to study the  ...  To further investigate the ability of an agent to adapt to the new environment after a switch, we analyzed performance as a function of two free parameters that control the setting of the task: the fraction  ... 
doi:10.1162/neco_a_01025 pmid:29064784 fatcat:itckhrsahfa7jbopgzj4qm3rlu
« Previous Showing results 1 — 15 out of 6,407 results