The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
Instances of the futile questioning problem abound in applications, especially, in the area of artificial intelligence. The problem can be represented by a particular quantified ...
Abstract. This paper pursues three primary objectives. First, a brief introduction to system-of-systems is presented in order to establish a foundation for exploration of the role ...
We present a corpus of spoken dialogues between students and an adaptive Wizard-of-Oz tutoring system, in which student uncertainty was manually annotated in real-time. We detail ...
Katherine Forbes-Riley, Diane J. Litman, Scott Sil...
In this paper we present an integrated approach to the development of Complex Web Applications. The principal philosophy of the development is to support simplicity, consistency, ...
Gary Griffiths, Mike A. Lockyer, Briony J. Oates, ...