Sciweavers

104 search results - page 8 / 21
» Maximizing the Lifetime of Dominating Sets
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Double Mobility: Coverage of the Sea Surface with Mobile Sensor Networks
Abstract—We are interested in the sensor networks for scientific applications to cover and measure statistics on the sea surface. Due to flows and waves, the sensor nodes may g...
Ji Luo, Dan Wang, Qian Zhang
INFOCOM
2002
IEEE
14 years 17 days ago
Optimal Rate Allocation and Traffic Splits for Energy Efficient Routing in Ad Hoc Networks
Abstract— In this paper, we address the problem of providing traffic quality of service and energy efficiency in ad hoc wireless networks. We consider a network that is shared ...
Vikram Srinivasan, Carla-Fabiana Chiasserini, Pava...
IPPS
2006
IEEE
14 years 1 months ago
Battery aware dynamic scheduling for periodic task graphs
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...
V. Rao, N. Navet, G. Singhal, A. Kumar, G. S. Visw...
EUSFLAT
2007
13 years 9 months ago
On the k-additive Core of Capacities
We investigate in this paper the set of kadditive capacities dominating a given capacity, which we call the k-additive core. We study its structure through achievable families, wh...
Michel Grabisch, Pedro Miranda
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 7 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch