9997 search results - page 380 / 2000 » The case for crowd computing |
147
click to vote
DFT
2004
IEEE
15 years 10 months ago
2004
IEEE
We present a model for computing the probability of a parametric failure due to a spot defect. The analysis is based on electromigration in conductors under unidirectional current...
177
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
164
click to vote
CCCG
2008
15 years 8 months ago
2008
An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points in a rectangular region, is presented. The worst case time and space comple...
186
click to vote
PC
2007
15 years 6 months ago
2007
This paper presents a case study about the applicability and usage of non blocking collective operations. These operations provide the ability to overlap communication with computa...
172
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper addresses a constrained two-terminal reliability measure referred to as Distance Reliability (DR) between the source node u and the destination node I with the shortest...