A branch-and-cut approach to examining the maximum density guarantee for pinwheel schedulability of low-dimensional vectors.
Wei DingPublished in: Real Time Syst. (2020)
Keyphrases
- peer to peer
- low dimensional
- fault tolerant
- load balancing
- vector space
- lower dimensional
- high dimensional
- manifold learning
- dimensionality reduction
- high dimensional data
- principal component analysis
- data points
- input space
- feature space
- distributed systems
- euclidean space
- covariance matrices
- linear subspace
- dimension reduction
- high dimensional feature space
- semantic space
- multidimensional scaling
- data sets
- principal components
- subspace learning
- binary vectors
- input data
- pattern recognition
- learning algorithm