Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Database software can be tailored for specific application domains and their required functionality, for specific hardware and its characteristics, or for other purposes. This bri...
One of the main problems faced by university students is deciding the right learning path based on available information such as courses, schedules and professors. In this context,...
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
—Workload characterisation and generation is becoming an increasingly important area as hardware and application complexities continue to advance. In this paper, we introduce a c...