1073 search results - page 43 / 215 » Formal Program Development with Approximations |
EUROCAST
2007
Springer
14 years 17 days ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
ICLP
2010
Springer
14 years 3 days ago
2010
Springer
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
HOTOS
2007
IEEE
14 years 17 days ago
2007
IEEE
In the paper we examine one of the issues in designing, specifying, implementing and formally verifying a small operating system kernel -- how to provide a productive and iterativ...
SAS
1991
Springer
14 years 6 days ago
1991
Springer
Specializing programs by partial evaluation is well defined extensionally, but in practice no intensional properties, such as what the specialized programs will look like or how ...