We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
In this note we show how the implicit filtering algorithm can be coupled with the BFGS quasi-Newton update to obtain a superlinearly convergent iteration if the noise in the object...
Any model of the world a robot constructs on the basis of its sensor data is necessarily both incomplete, due to the robot’s limited window on the world, and uncertain, due to s...
Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by c...
This study aimed to design and evaluate multimedia games which were based on the theories of children's development of taxonomic concepts. Factors that might affect children&...