Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Simon, Hans U."'
Autor:
Simon, Hans U.
We define and study greedy matchings in vertex-ordered bipartite graphs. It is shown that each vertex-ordered bipartite graph has a unique greedy matching. The proof uses (a weak form of) Newman's lemma. The vertex ordering is called a preference rel
Externí odkaz:
http://arxiv.org/abs/2402.06729
Autor:
Simon, Hans U.
Quite recently a teaching model, called "No-Clash Teaching" or simply "NC-Teaching", had been suggested that is provably optimal in the following strong sense. First, it satisfies Goldman and Matthias' collusion-freeness condition. Second, the NC-tea
Externí odkaz:
http://arxiv.org/abs/2205.02792
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 Mathias (1996), and various teaching models obeying their criterion have
Externí odkaz:
http://arxiv.org/abs/1903.04012
Autor:
Simon, Hans U.
It is well known that the containment problem (as well as the equivalence problem) for semilinear sets is $\log$-complete in $\Pi_2^p$. It had been shown quite recently that already the containment problem for multi-dimensional linear sets is $\log$-
Externí odkaz:
http://arxiv.org/abs/1710.04533
Autor:
Simon, Hans U.
Publikováno v:
Proceedings of the 34th International Conference on Algorithmic Learning Theory
Proceedings of the Machine Learning Research
Proceedings of the Machine Learning Research
Quite recently a teaching model, called "No-Clash Teaching" or simply "NC-Teaching", had been suggested that is provably optimal in the following strong sense. First, it satisfies Goldman and Matthias' collusion-freeness condition. Second, the NC-tea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4fdb783717e64ce0f48d221e50ba83df
https://hdl.handle.net/21.11116/0000-000C-1606-521.11116/0000-000C-1608-321.11116/0000-000C-C417-D
https://hdl.handle.net/21.11116/0000-000C-1606-521.11116/0000-000C-1608-321.11116/0000-000C-C417-D
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Birkendorf, Andreas **The author gratefully acknowledges the support of Deutsche Forschungsgemeinschaft Grant Si 498/3-2., Klasner, Norbert, Kuhlmann, Christian ††The author gratefully acknowledges the support of the German–Israeli Foundation for Scientific Research and Development Grant I-403-001.06/95., Simon, Hans U ‡‡The author gratefully acknowledges the support of Deutsche Forschungsgemeinschaft Grant Si 498/3-2 and the support of the German–Israeli Foundation for Scientific Research and Development Grant I-403-001.06/95. Corresponding author.
Publikováno v:
In Journal of Computer and System Sciences April 2000 60(2):258-277
Publikováno v:
In Theoretical Computer Science 2000 240(2):471-485
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Proceedings of the Eleventh Annual Conference: Computational Learning Theory; 7/24/1998, p144-153, 10p