The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
AbstractThis paper presents a real-coded memetic algorithm that combines a high diversity global exploration with an adaptive local search method to the most promising individuals ...
Methods for identifying usability problems in web page designs should ideally also provide practical methods for repairing the problems found. Blackmon et al. [2] proved the usefu...
Marilyn Hughes Blackmon, Muneo Kitajima, Peter G. ...
Traditional information systems return answers after a user submits a complete query. Users often feel "left in the dark" when they have limited knowledge about the unde...
—Consider the problem of a robot (learning mechanism or algorithm) attempting to locate a point on a line. The mechanism interacts with a random environment which essentially inf...