5084 search results - page 680 / 1017 » Proving Possibility Properties |
155
click to vote
AADEBUG
1997
Springer
15 years 11 months ago
1997
Springer
Previously the debugging of optimised code has not been possible without recompiling the executable code and preventing the use of code optimisation techniques. Although current r...
184
Voted
EMMCVPR
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
172
click to vote
TAPSOFT
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. Reasoning on programs and automated deduction often require the manipulation of in nite sets of objects. Many formalisms have been proposed to handle such sets. Here we d...
242
click to vote
AC
1992
Springer
15 years 11 months ago
1992
Springer
Logic and databases have gone a long way together since the advent of relational databases. Already the rst basic query languages for relational databases beside relational algebra...
174
Voted
STACS
1994
Springer
15 years 10 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...