674 search results - page 74 / 135 » The computational complexity of the parallel knock-out probl... |
CHI
2004
ACM
16 years 1 months ago
2004
ACM
The complexity of many problems necessitates creating and exploring multiple, alternative solutions. However, current user interfaces do not cleanly support creating alternatives ...
CLUSTER
2007
IEEE
15 years 7 months ago
2007
IEEE
— The service-oriented architecture has come a long way in solving the problem of reusability of existing software resources. Grid applications today are composed of a large numb...
113
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
128
click to vote
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
104
click to vote
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...