We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
We consider several distributed collaborative key agreement protocols for dynamic peer groups. This problem has several important characteristics which make it different from trad...
Patrick P. C. Lee, John C. S. Lui, David K. Y. Yau
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
Distributed teams can carry out critical tasks with appropriate decision support technologies. The architecture and detailed design of a Web-based GDSS, called TeamSpirit, are dis...