Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
Barna Saha, Allison Hoch, Samir Khuller, Louiqa Ra...
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
Conventional research on similarity search focuses on measuring the similarity between objects with the same type. However, in many real-world applications, we need to measure the...
Chuan Shi, Xiangnan Kong, Philip S. Yu, Sihong Xie...