A constraint expresses a relationship among one or more variables. Constraints are very useful in the development of collaborative applications, such as collaborative CAD and CASE ...
Kai Lin, David Chen, Chengzheng Sun, R. Geoff Drom...
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
A novel packet multiplexing technique, called Rotating-Priority-Queues (RPQ), is presented which exploits the tradeoff between high eficiency, i.e., the ability to support many co...
: This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. In case of the common assumption of an errorfree communication, the...
This paper presents a Greedy-Least Saturation Degree (G-LSD) heuristic (which is an adaptation of the least saturation degree heuristic) to solve a real-world examination timetabli...
Masri Ayob, Ariff Md. Ab. Malik, Salwani Abdullah,...