9997 search results - page 388 / 2000 » The case for crowd computing |
195
click to vote
ISIPTA
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper reviews algorithms for local computation with imprecise probabilities. These algorithms try to solve problems of inference calculation of conditional or unconditional p...
164
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to 2n,2 node failures. Compared to the optimal algorithm in a...
141
Voted
ACMDIS
1997
ACM
15 years 11 months ago
1997
ACM
The design of tailorable systems is an important issue for fields of application which are characterized by differentiation and dynamics. We show how tailorability can be combined...
142
click to vote
MFCS
1993
Springer
15 years 11 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
140
click to vote
CASES
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we describe the organization and microarchitecture of MT-MB, a configurable implementation of the Xilinx MicroBlaze soft processor that supports multithreading. Usi...