1451 search results - page 227 / 291 » Order independence and rationalizability |
134
click to vote
CLEIEJ
2006
15 years 6 months ago
2006
This paper describes a single-version algorithmic approach to design in fault tolerant computing in various computing systems by using static redundancy in order to mask transient...
160
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
162
click to vote
DATAMINE
2006
15 years 6 months ago
2006
Standard hidden Markov models (HMM's) have been studied extensively in the last two decades. It is well known that these models assume state conditional independence of the ob...
161
click to vote
ET
2006
15 years 6 months ago
2006
1 Fault diagnosis of full-scan designs has been progressed significantly. However, most existing techniques are aimed at a logic block with a single fault. Strategies on top of the...
186
click to vote
FTTCS
2006
15 years 6 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...