Sciweavers

997 search results - page 11 / 200
» Completely Lazy Learning
Sort
View
PLILP
1994
Springer
14 years 1 months ago
Combining Lazy Narrowing with Disequality Constraints
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
Puri Arenas-Sánchez, Ana Gil-Luezas, Franci...
ECAI
1994
Springer
14 years 1 months ago
Combining the Lazy Label Evaluation with Focusing Techniques in an ATMS
For large problems the ATMS often becomes the main resource consumer in any reasoning system. We propose an architecture (the 2vATMS) that combines the advantages of two techniques...
Mugur M. Tatar
AAAI
2012
12 years 6 days ago
Transportability of Causal Effects: Completeness Results
The study of transportability aims to identify conditions under which causal information learned from experiments can be reused in a different environment where only passive obser...
Elias Bareinboim, Judea Pearl
STACS
1999
Springer
14 years 2 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
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...
Rüdiger Reischuk, Thomas Zeugmann
FOCS
2009
IEEE
14 years 4 months ago
A Complete Characterization of Statistical Query Learning with Applications to Evolvability
Statistical query (SQ) learning model of Kearns is a natural restriction of the PAC learning model in which a learning algorithm is allowed to obtain estimates of statistical prop...
Vitaly Feldman