158 search results - page 29 / 32 » The Cover Time, the Blanket Time, and the Matthews Bound |
JDA
2007
13 years 8 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
COMCOM
2006
13 years 8 months ago
2006
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
WG
2005
Springer
14 years 2 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
SIGECOM
2011
ACM
12 years 11 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—Broadcast is one of the most fundamental services in wireless sensor networks (WSNs). It facilitates sensor nodes to propagate messages across the whole network, serving a wide ...