Sciweavers

21324 search results - page 63 / 4265
» Making the case for computing
Sort
View
ICS
2010
Tsinghua U.
14 years 2 months ago
Making nested parallel transactions practical using lightweight hardware support
Woongki Baek, Nathan Grasso Bronson, Christos Kozy...
FOCS
1997
IEEE
14 years 2 months ago
Making Nondeterminism Unambiguous
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...
Klaus Reinhardt, Eric Allender
CLUSTER
2008
IEEE
14 years 4 months ago
Empirical-based probabilistic upper bounds for urgent computing applications
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
Nick Trebon, Peter H. Beckman
CF
2004
ACM
14 years 3 months ago
A framework for resource discovery in pervasive computing for mobile aware task execution
Aimed to provide computation ubiquitously, pervasive computing is perceived as a means to provide a user the transparency of anywhere, anyplace, anytime computing. Pervasive compu...
K. Kalapriya, S. K. Nandy, Deepti Srinivasan, R. U...