528 search results - page 61 / 106 » Transition Logic Revisited |
111
click to vote
ICANN
2009
Springer
15 years 6 months ago
2009
Springer
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
APN
2000
Springer
15 years 6 months ago
2000
Springer
One of the most efficient analysis technique is to reduce an original model into a simpler one such that the reduced model has the same properties than the original one. G. Berthel...
133
click to vote
ASPDAC
1995
ACM
15 years 5 months ago
1995
ACM
— The goal of transistor reordering for a logic gate is to reduce the propagation delay as well as the charging and discharging of internal capacitances to achieve low power cons...
108
click to vote
TCAD
2008
15 years 1 months ago
2008
State encoding is one of the most difficult problems in the synthesis of asynchronous controllers. This paper presents a method that can solve the problem of large controllers spec...
119
click to vote
TCAD
1998
15 years 1 months ago
1998
Most existing tools for the synthesisof asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper ...