1894 search results - page 210 / 379 » A TLA Proof System |
146
click to vote
STOC
1994
ACM
15 years 8 months ago
1994
ACM
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
133
click to vote
FLOPS
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we describe some certified algorithms for exact real arithmetic based on co-recursion. Our work is based on previous experiences using redundant digits of base 2 but ...
122
click to vote
ACL
2006
15 years 5 months ago
2006
This paper presents a pilot study of the use of phrasal Statistical Machine Translation (SMT) techniques to identify and correct writing errors made by learners of English as a Se...
105
click to vote
FMOODS
2006
15 years 5 months ago
2006
We present the modeling and validation experiments performed with the IFx validation toolset and with the UML profile developed within the IST Omega project, on a representative sp...
132
click to vote
APAL
2008
15 years 4 months ago
2008
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of ...