Let I be a stable matching instance with N stable matchings. For each man m, order his (not necessarily distinct) N partners from his most preferred to his least preferred. Denote...
With the rapid growth of real world applications for NLP systems, there is a genuine demand for a general toolkit from which programmers with no linguistic knowledge can build spe...
Hassan Alam, Hua Cheng, Rachmat Hartono, Aman Kuma...
This paper develops a multiscale connectivity theory for shapes based on the axiomatic definition of new generalized connectivity measures, which are obtained using morphology-base...
This paper studies the convergence of a fixed point iteration algorithm for the problem of max-min signal-to-interference ratio (SIR) balancing. Differently from the existing wor...
In this paper we apply the recent notion of anytime universal intelligence tests to the evaluation of a popular reinforcement learning algorithm, Q-learning. We show that a general...