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

E.J. Krahmer, R.M.F. Koolen, M. Theune

Research output: Contribution to journal › Article › Scientific › peer-review

6 Citations (Scopus)

Original language	English
Pages (from-to)	837-841
Journal	Cognitive Science
Volume	36
Issue number	5
Publication status	Published - 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-Blackwell",

number = "5",

}

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

SN - 0364-0213

VL - 36

SP - 837

EP - 841

JO - Cognitive Science

JF - Cognitive Science

IS - 5

ER -