The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
: Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimizatio...
: The challenge of the semantic web is the provision of distributed information with well defined meaning, understandable for different parties. Particularly, applications should b...
In this paper, we propose a novel non-parametric clustering method based on non-parametric local shrinking. Each data point is transformed in such a way that it moves a specific ...
In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing syste...