On the convergence of the Hegselmann-Krause system (Q2986859): Difference between revisions

@@ Property / arXiv ID @@
+.1909
@@ Property / arXiv ID: 1211.1909 / rank @@
+Normal rank
@@ Property / cites work @@
+Learning from different teachers
@@ Property / cites work: Learning from different teachers / rank @@
+Normal rank
@@ Property / cites work @@
+On specifying Boolean functions by labelled examples
+Normal rank
@@ Property / cites work @@
+Measuring teachability using variants of the teaching dimension
+Normal rank
@@ Property / cites work @@
+Algorithmic Learning Theory
@@ Property / cites work: Algorithmic Learning Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Teaching Randomized Learners
@@ Property / cites work: Teaching Randomized Learners / rank @@
+Normal rank
@@ Property / cites work @@
+Recent Developments in Algorithmic Teaching
@@ Property / cites work: Recent Developments in Algorithmic Teaching / rank @@
+Normal rank
@@ Property / cites work @@
+Occam's razor
@@ Property / cites work: Occam's razor / rank @@
+Normal rank
@@ Property / cites work @@
+Q4013552
@@ Property / cites work: Q4013552 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of inductive inference from good examples
+Normal rank
@@ Property / cites work @@
+Q3272460
@@ Property / cites work: Q3272460 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of teaching
@@ Property / cites work: On the complexity of teaching / rank @@
+Normal rank
@@ Property / cites work @@
+Teaching a smarter learner.
@@ Property / cites work: Teaching a smarter learner. / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of goal-oriented communication
@@ Property / cites work: A theory of goal-oriented communication / rank @@
+Normal rank
@@ Property / cites work @@
+In search of an easy witness: Exponential time vs. probabilistic polynomial time.
+Normal rank
@@ Property / cites work @@
+Q4526985
@@ Property / cites work: Q4526985 / rank @@
+Normal rank
@@ Property / cites work @@
+Derandomizing polynomial identity tests means proving circuit lower bounds
+Normal rank
@@ Property / cites work @@
+Q4013545
@@ Property / cites work: Q4013545 / rank @@
+Normal rank
@@ Property / cites work @@
+A model of interactive teaching
@@ Property / cites work: A model of interactive teaching / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom generators for space-bounded computation
+Normal rank
@@ Property / cites work @@
+On the limits of efficient teachability
@@ Property / cites work: On the limits of efficient teachability / rank @@
+Normal rank
@@ Property / cites work @@
+Teachability in computational learning
@@ Property / cites work: Teachability in computational learning / rank @@
+Normal rank
@@ Property / cites work @@
+A theory of the learnable
@@ Property / cites work: A theory of the learnable / rank @@
+Normal rank
@@ Property / cites work @@
+Q5396611
@@ Property / cites work: Q5396611 / rank @@
+Normal rank