Analysis of Possibilities and Effectiveness of Combine Rough Sets and Neighborhood Theories for Solving Dynamic Scheduling Problem

Henryk Piech. Analysis of Possibilities and Effectiveness of Combine Rough Sets and Neighborhood Theories for Solving Dynamic Scheduling Problem. In Fourth International Conference on Dependability of Computer Systems, DepCos-RELCOMEX '09, Brunow, Poland, June 30 - July 2, 2009. pages 296-303, IEEE Computer Society, 2009. [doi]

Abstract

Abstract is missing.