Sciweavers

1677 search results - page 295 / 336
» On the Completeness of Quantum Computation Models
Sort
View
110
Voted
FOSSACS
2003
Springer
15 years 6 months ago
A Game Semantics for Generic Polymorphism
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
Samson Abramsky, Radha Jagadeesan
FTRTFT
1998
Springer
15 years 5 months ago
On the Need for Practical Formal Methods
A controversial issue in the formal methods community is the degree to which mathematical sophistication and theorem proving skills should be needed to apply a formal method. A fun...
Constance L. Heitmeyer
SIGMETRICS
1996
ACM
174views Hardware» more  SIGMETRICS 1996»
15 years 5 months ago
Embra: Fast and Flexible Machine Simulation
This paper describes Embra, a simulator for the processors, caches, and memory systems of uniprocessors and cache-coherent multiprocessors. When running as part of the SimOS simul...
Emmett Witchel, Mendel Rosenblum
ISDO
2000
181views Business» more  ISDO 2000»
15 years 2 months ago
eFlow: an Open, Flexible and Configurable Approach to Service Composition
The Web is rapidly becoming the platform through which many companies deliver services to businesses and individual customers. E-Services are typically delivered point-to-point; h...
Fabio Casati
JCC
2006
110views more  JCC 2006»
15 years 1 months ago
Using internal and collective variables in Monte Carlo simulations of nucleic acid structures: Chain breakage/closure algorithm
: This article describes a method for solving the geometric closure problem for simplified models of nucleic acid structures by using the constant bond lengths approximation. The r...
Heinz Sklenar, Daniel Wüstner, Remo Rohs