Sciweavers

2799 search results - page 252 / 560
» computing 1998
Sort
View
120
Voted
ET
1998
99views more  ET 1998»
15 years 3 months ago
Design of Self-Testing Checkers for m-out-of-n Codes Using Parallel Counters
This paper extends the design method of self-testing checkers (STCs) for some m-out-of-n (m/n) codes, proposed recently in IEEE Trans. Comput., 1995 by Dimakopoulos et al. The chec...
Stanislaw J. Piestrak
105
Voted
IPL
1998
177views more  IPL 1998»
15 years 3 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
JaeCheol Ha, Sang-Jae Moon
172
Voted
JCSC
1998
227views more  JCSC 1998»
15 years 3 months ago
Continuous and Hybrid Petri Nets
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
Hassane Alla, René David
128
Voted
KBS
1998
122views more  KBS 1998»
15 years 3 months ago
Concept formation in design
: This paper presents a computationally tractable view on where simple design concepts come from by proposing a paradigm for the formation of design concepts based on the emergence...
John S. Gero
105
Voted
MOC
1998
62views more  MOC 1998»
15 years 3 months ago
Numerical evaluation of a symmetric potential function
Abstract. We discuss the numerical evaluation of a symmetric potential function which arises naturally in applications. We present a method designed to accurately and efficiently c...
Lori A. Carmack