We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
—Energy consumption continues to be a major concern in multiple application domains including powerhungry data centers, portable and wearable devices, mobile communication device...
Anthony Rowe, Karthik Lakshmanan, Haifeng Zhu, Rag...
In this paper, we introduce novel probabilistic transmission protocols for data intensive wireless sensor networks. The protocols combine a randomized transmission scheme with sch...
Chih-Kuang Lin, Vladimir Zadorozhny, Prashant Kris...
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
Kai Xing, Wei Cheng, E. K. Park, Shmuel Rotenstrei...
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...