Traditional Active Learning (AL) techniques assume that the annotation of each datum costs the same. This is not the case when annotating sequences; some sequences will take longe...
Robbie Haertel, Eric K. Ringger, Kevin D. Seppi, J...
Ever-changing production campaigns complicate the management of recovery and treatment options for unavoidable effluents at pharmaceutical plants. Each campaign produces large amo...
Aninda Chakraborty, Andres Malcolm, Richard D. Col...
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
Harry Buhrman, Benjamin J. Hescott, Steven Homer, ...
Abstract. The paper presents methods for model checking a class of possibly infinite state concurrent programs using various types of bi-simulation reductions. The proposed method...
In this paper we continue the study of ‘sabotage modal logic’ SML which was suggested by van Benthem. In this logic one describes the progression along edges of a transition gr...