Sciweavers

6829 search results - page 1325 / 1366
» Quantitative Generalizations of Languages
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 2 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
ECML
1993
Springer
14 years 2 months ago
Integrated Learning Architectures
Research in systems where learning is integrated to other components like problem solving, vision, or natural language is becoming an important topic for Machine Learning. Situatio...
Enric Plaza, Agnar Aamodt, Ashwin Ram, Walter Van ...
RULES
1993
Springer
134views Database» more  RULES 1993»
14 years 1 months ago
Temporal Rule Specification and Management in Object-oriented Knowledge Bases
There have been many recent research efforts on temporal databases for managing current and historical data and on active databases for monitoring real-world events as well as dat...
Stanley Y. W. Su, Hsin-Hsing M. Chen
PODS
1994
ACM
91views Database» more  PODS 1994»
14 years 1 months ago
A Polymorphic Calculus for Views and Object Sharing
We present a typed polymorphic calculus that supports a general mechanism for view definition and object sharing among classes. In this calculus, a class can contain inclusion spe...
Atsushi Ohori, Keishi Tajima
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
14 years 1 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
« Prev « First page 1325 / 1366 Last » Next »