Lister and Leaney (Lister and Leaney, 2003b) presented a "coherent, explicit grading philosophy based on Bloom's taxonomy". I applied this philosophy to a second ye...
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
Gaining and sustaining competitive advantage through knowledge sharing and network-based knowledge processes is a process involving the tasks of formulating a strategic vision, fo...
Learning on real robots in an real, unaltered environment provides an extremely challenging problem. Many of the simplifying assumptions made in other areas of learning cannot be ...
This paper presents an algebra for conflict resolution in nonlinear planning. A set of conflicts in a plan is considered as a constraint network. Each node in the network represen...