102 citations · 118 across the 4 of their papers we have counts for
5 papers
On the Complexity of Symbolic Finite-State Automata
Dana Fisman, Hadar Frenkel, Sandra Zilles
We revisit the complexity of procedures on SFAs (such as intersection, emptiness, etc.) and analyze them according to the measures we find suitable for symbolic automata: the numbe…
Optimal Collusion-Free Teaching
David Kirkpatrick, Hans U. Simon, Sandra Zilles
Formal models of learning from teachers need to respect certain criteria to avoid collusion. The most commonly accepted notion of collusion-freeness was proposed by Goldman and Mat…
An Overview of Machine Teaching
Xiaojin Zhu, Adish Singla, Sandra Zilles +1
In this paper we try to organize machine teaching as a coherent set of ideas. Each idea is presented as varying along a dimension. The collection of dimensions then form the proble…
An Empirical Study of the Effects of Spurious Transitions on Abstraction-based Heuristics
Mehdi Sadeqi, Robert C. Holte, Sandra Zilles
The efficient solution of state space search problems is often attempted by guiding search algorithms with heuristics (estimates of the distance from any state to the goal). A popu…
Preference-based Teaching
Ziyuan Gao, Christoph Ries, Hans Ulrich Simon +1
We introduce a new model of teaching named "preference-based teaching" and a corresponding complexity parameter---the preference-based teaching dimension (PBTD)---representing the…