Scheduling computational process on the basis of ranked models and CPL criterion functions

Authors:
Leon Bobrowski
Affiliations:
Faculty of Computer Science, Białystok Technical University and Institute of Biocybernetics and Biomedical Engineering, PAS, Warsaw, Poland
Venue:
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Year:
2008

Citing 4
Cited 0

Design of piecewise linear classifiers from formal neurons by a basis exchange technique

Pattern Recognition
Scheduling computer and manufacturing processes

Scheduling computer and manufacturing processes
Operating Systems (5th Edition)

Operating Systems (5th Edition)
Ranked modelling with feature selection based on the CPL criterion functions

MLDM'05 Proceedings of the 4th international conference on Machine Learning and Data Mining in Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling procedures allow to determine the order of realization of particular tasks of a given complex process. The order of such tasks can be represented as a ranked relation between some of them. Ranked models have the form of linear transformations of multivariate feature vectors on a line which preserve in a satisfactory manner a given set of ranked relations between components. The linear ranked transformations can be designed through minimization of adequate CPL criterion functions. Theoretical properties of this approach to scheduling and their applications are discussed in the paper.