Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliļ¬...
Aimed to provide computation ubiquitously, pervasive computing is perceived as a means to provide a user the transparency of anywhere, anyplace, anytime computing. Pervasive compu...
K. Kalapriya, S. K. Nandy, Deepti Srinivasan, R. U...
Abstract. Ozaās Online Boosting algorithm provides a version of AdaBoost which can be trained in an online way for stationary problems. One perspective is that this enables the p...
Adam Pocock, Paraskevas Yiapanis, Jeremy Singer, M...
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Abstract There has been considerable interest in the identiļ¬cation of structural properties of combinatorial problems that lead to efļ¬cient algorithms for solving them. Some of...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...