You will perform a heuristic evaluation (individually) of their user interface using only the materials they turned in for their last project report (“Interactive Prototype” write-up & working demo). Using their tasks, scenarios, interface design, screen shots, and interactive prototype you will apply Nielsen’s heuristics to the user interface. You should be able to get all of this information ...

1.1 Introduction hsp is a planner based on the ideas of heuristic search. 1 Heuristic search algorithms perform forward search from an initial state to a goal state using an heuristic function that provides an estimate of the distance to the goal. The 8-puzzle is the standard example of heuristic search and is treated in most AI textbooks 9, 10]. The main diierence between the 8-puzzle and our ...

The purpose of this research is the identification of a paradigm which fixes the basic concepts and the type of logical relationships between them, whereby direct, govern and evaluate choises on new technologies. The contribution is based on the assumption that the complexity of knowledge is correlated with the complexity of the learning environment. From the existence of this correlation will ...

We consider the problem of allocating a single server to a system of queues with Poisson arrivals. Each queue represents a class of jobs and possesses a holding cost rate, general service distribution, and general setup time distribution. The objective is to minimize the expected holding cost due to the waiting of jobs. A setup time is required to switch from one queue to another. We provide a ...

A broad range of well-structured problems--embracing forms of diagnosis, catalog selection, and skeletal planning--are solved in 'expert systems" by the methods of heuristic classification. These programs have a characteristic inference structure that systematically relates data to a pre-enumerated set of solutions by abstraction, heuristic association, and refinement. In contrast with previous...

1. The computational complexity of many problems means that optimal solutions are unlikely to be found in reasonable time in larger instances. 2. Problems may be ill-defined or data imprecise, so that an optimal solution based on estimated data will almost certainly not be optimal for the actual data. In such a situation it is preferable to obtain a robust solution that will be near-optimal ove...

The allocation of fresh produce to shelf space represents a new decision support research area which is motivated by the desire of many retailers to improve their service due to the increasing demand for fresh food. However, automated decision making for fresh produce allocation is challenging because of the very short lifetime of fresh products. This paper considers a recently proposed practic...