Is it that difficult to find a good preference order for the incremental algorithm?

Research output: Contribution to journalArticleScientificpeer-review

Original languageEnglish
Pages (from-to)837-841
JournalCognitive Science
Volume36
Issue number5
Publication statusPublished - 2012

Cite this

@article{70bb2c334c724a22986e1311a6c95c6a,
title = "Is it that difficult to find a good preference order for the incremental algorithm?",
author = "E.J. Krahmer and R.M.F. Koolen and M. Theune",
note = "Is it that difficult to find a good preference order for the Incremental Algorithm?",
year = "2012",
language = "English",
volume = "36",
pages = "837--841",
journal = "Cognitive Science",
issn = "0364-0213",
publisher = "Wiley",
number = "5",

}

Is it that difficult to find a good preference order for the incremental algorithm? / Krahmer, E.J.; Koolen, R.M.F.; Theune, M.

In: Cognitive Science, Vol. 36, No. 5, 2012, p. 837-841.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Is it that difficult to find a good preference order for the incremental algorithm?

AU - Krahmer, E.J.

AU - Koolen, R.M.F.

AU - Theune, M.

N1 - Is it that difficult to find a good preference order for the Incremental Algorithm?

PY - 2012

Y1 - 2012

M3 - Article

VL - 36

SP - 837

EP - 841

JO - Cognitive Science

JF - Cognitive Science

SN - 0364-0213

IS - 5

ER -