The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
Limitations of state-of-the-art teleoperation systems can be compensated by using shared-control teleoperation architectures that provide haptic assistance to the human operator. T...
Service-oriented computing and the ensuing science of services represent significant challenges to academia. As we come to grips with its many implications, we are slowly beginnin...
Sandeep Purao, Vijay K. Vaishnavi, John W. Bagby, ...