Sciweavers

128 search results - page 4 / 26
» An Implicit Characterization of PSPACE
Sort
View
PPOPP
2006
ACM
15 years 4 months ago
Performance characterization of molecular dynamics techniques for biomolecular simulations
Large-scale simulations and computational modeling using molecular dynamics (MD) continues to make significant impacts in the field of biology. It is well known that simulations...
Sadaf R. Alam, Jeffrey S. Vetter, Pratul K. Agarwa...
LOPSTR
1997
Springer
15 years 2 months ago
Implicit Program Synthesis by a Reversible Metainterpreter
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
Henning Christiansen
IANDC
2006
83views more  IANDC 2006»
14 years 10 months ago
Implicit complexity over an arbitrary structure: Quantifier alternations
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
ECCC
2008
98views more  ECCC 2008»
14 years 10 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
DAC
1995
ACM
15 years 1 months ago
Performance Analysis of Embedded Software Using Implicit Path Enumeration
—Embedded computer systems are characterized by the presence of a processor running application-specific dedicated software. A large number of these systems must satisfy real-ti...
Yau-Tsun Steven Li, Sharad Malik