19 search results - page 4 / 4 » stacs 1999 |
STACS
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
STACS
1999
Springer
13 years 9 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
STACS
1999
Springer
13 years 9 months ago
1999
Springer
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...
STACS
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...