4940 search results - page 581 / 988 » On the Complexity of Universal Programs |
184
click to vote
ENTCS
2008
15 years 6 months ago
2008
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
126
Voted
ANNALS
2006
15 years 6 months ago
2006
This paper describes an interactive simulation of the Electronical Numerical Integrator and Computer (ENIAC). With the simulator, the user can wire up complex configurations of th...
175
click to vote
IJAR
2008
15 years 6 months ago
2008
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider g...
182
Voted
TCS
2008
15 years 6 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
170
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
This paper describes a partial parser that assigns syntactic structures to sequences of partof-speech tags. The program uses the maximum entropy parameter estimation method, which...