Sciweavers

3192 search results - page 333 / 639
» The minimum latency problem
Sort
View
JCO
2006
153views more  JCO 2006»
15 years 4 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
MP
2006
80views more  MP 2006»
15 years 4 months ago
Minimizing Polynomials via Sum of Squares over the Gradient Ideal
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...
Jiawang Nie, James Demmel, Bernd Sturmfels
SIAMDM
2008
113views more  SIAMDM 2008»
15 years 4 months ago
Power Domination in Product Graphs
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dom...
Paul Dorbec, Michel Mollard, Sandi Klavzar, Simon ...
155
Voted
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
15 years 4 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
ADHOC
2005
122views more  ADHOC 2005»
15 years 4 months ago
Maintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clusterin...
Yuanzhu Peter Chen, Arthur L. Liestman