3690 search results - page 530 / 738 » Computation with classical sequents |
177
Voted
ICPP
2006
IEEE
15 years 11 months ago
2006
IEEE
— Molecular Dynamics (MD) is an important atomistic simulation technique, with widespread use in computational chemistry, biology, and materials. An important limitation of MD is...
147
click to vote
HPDC
1998
IEEE
15 years 9 months ago
1998
IEEE
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...
170
click to vote
ACSAC
2009
IEEE
15 years 9 months ago
2009
IEEE
Emerging distributed computing architectures, such as grid and cloud computing, depend on the high integrity execution of each system in the computation. While integrity measuremen...
134
click to vote
CIE
2010
Springer
15 years 9 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
168
Voted
SIAMCOMP
1998
15 years 5 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...