1888 search results - page 84 / 378 » Proof theory and computational analysis |
126
click to vote
POPL
2012
ACM
13 years 8 months ago
2012
ACM
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
99
Voted
JUCS
2008
15 years 13 days ago
2008
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
106
click to vote
STOC
1989
ACM
15 years 4 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
126
click to vote
DKE
2002
15 years 9 days ago
2002
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
151
Voted
GECCO
2011
Springer
14 years 4 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...