Henderson Repository is a free resource of the Honor

developing utilisation schemes for an artefact

• to make derivative works Under the following conditions: Attribution. You must give the original author credit. Noncommercial. You may not use this work for commercial purposes. Share Alike. If you alter, transform, or build upon this work, you may distribute the resulting work only under a license identical to this one. • For any reuse or distribution, you must make clear to others the license terms of this work. • Any of these conditions can be waived if you get permission from the copyright holder. Your fair use and other rights are in no way affected by the above. This is a human-readable summary of the Legal Code (the full license). You can download the electronic version from

Considerable evidence indicates that domain specific knowledge in the form of schemes is the primary factor distinguishing experts from novices in problem-solving skill. Evidence that conventional problem-solving activity is not effective in schema acquisition is also accumulating. It is suggested

We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional

Abstract not found

Where do new ideas come from? What psychological mechanisms underlie creative insight? This fundamental issue in the study of thought has received a great deal of informal discussion, but little empirical psychological investigation. The anecdotal reports of creative scientists and mathematicians

Multiclass learning problems involve nding a de nition for an unknown function f(x) whose range is a discrete set containing k>2values (i.e., k \classes"). The de nition is acquired by studying collections of training examples of the form hx i;f(x i)i. Existing approaches to multiclass

We have been developing tutors to help students learn programming concepts by solving problems. In this paper, we will discuss the use of problem-solving in Computer Science, the effectiveness of using problem-solving tutors to learn programming concepts, and the pedagogical relationship between

We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity