526 search results - page 22 / 106 » On the Number of Minimal Addition Chains |
104
click to vote
VTS
2003
IEEE
15 years 2 months ago
2003
IEEE
Reseeding is used to improve fault coverage of pseudorandom testing. The seed corresponds to the initial state of the LFSR before filling the scan chain. The number of determinist...
DAC
1994
ACM
1994
ACM
Performance Analysis and Optimization of Schedules for Conditional and Loop-Intensive Specifications
15 years 1 months ago
This paper presents a new method,based on Markov chain analysis, to evaluate the performance of schedules of behavioral specifications. The proposed performance measure is the expe...
105
click to vote
CORR
2010
Springer
14 years 4 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
LACL
2005
Springer
15 years 3 months ago
2005
Springer
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
AIPS
2003
14 years 11 months ago
2003
We present an efficient algorithm for exact calculation and minimization of expected waiting times of all passengers using a bank of elevators. The dynamics of the system are rep...