Sciweavers

4930 search results - page 285 / 986
» Learning minimal abstractions
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 4 months ago
Interactive Learning Based Realizability and 1-Backtracking Games
Abstract. We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game...
Federico Aschieri
ECAI
2010
Springer
15 years 4 months ago
Learning conditionally lexicographic preference relations
Abstract. We consider the problem of learning a user's ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general ...
Richard Booth, Yann Chevaleyre, Jérôm...
CAV
2012
Springer
198views Hardware» more  CAV 2012»
13 years 9 months ago
Termination Analysis with Algorithmic Learning
An algorithmic-learning-based termination analysis technique is presented. The new technique combines transition predicate abstraction, algorithmic learning, and decision procedure...
Wonchan Lee, Bow-Yaw Wang, Kwangkeun Yi
AAAI
2010
15 years 8 months ago
G-Optimal Design with Laplacian Regularization
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...
Chun Chen, Zhengguang Chen, Jiajun Bu, Can Wang, L...
IIE
2007
130views more  IIE 2007»
15 years 6 months ago
An Iterative Methodology for Teaching Object Oriented Concepts
Abstract thinking is a vital skill when learning computer science. Object technology and the concepts it is based upon make this skill even more crucial. However, previous research...
Irit Hadar, Ethan Hadar