The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
In this paper we show how model identifiability is an issue for student modeling: observed student performance corresponds to an infinite family of possible model parameter estimat...
Recently, we proposed a fast feature extraction approach denoted FSOM utilizes Self Organizing Map (SOM). FSOM [1] overcomes the slowness of traditional SOM search algorithm. We i...
Alaa El. Sagheer, Naoyuki Tsuruta, Rin-ichiro Tani...
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
We analyze various forms of the Frequency Assignment Problem using the theory of elementary landscapes. We show that three variants of the Frequency Assignment Problem are either ...
L. Darrell Whitley, J. Francisco Chicano, Enrique ...