In case of natural disasters or intentional attacks, telecommunication networks often get heavily damaged and current resilience schemes have proven to be insufficient for rapid r...
We study the problem of locating in space and over time a network path’s tight link, that is the link with the least available bandwidth on the path. Tight link localization ben...
Vinay J. Ribeiro, Rudolf H. Riedi, Richard G. Bara...
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...