Sciweavers

841 search results - page 74 / 169
» Approximability of Minimum AND-Circuits
Sort
View
JCO
2006
153views more  JCO 2006»
13 years 10 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
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 10 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
JMMA
2002
71views more  JMMA 2002»
13 years 10 months ago
Optimal Hierarchies for Quadrilateral Surfaces
Abstract. Multiresolution representation of quadrilateral surface approximation (MRQSA) is a useful representation for progressive graphics transmission in networks. Based on two r...
Kuo-Liang Chung, Wen-Ming Yan, Jung-Gen Wu
ESA
1998
Springer
145views Algorithms» more  ESA 1998»
14 years 2 months ago
Moving-Target TSP and Related Problems
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
Christopher S. Helvig, Gabriel Robins, Alexander Z...
HYBRID
2000
Springer
14 years 1 months ago
Ellipsoidal Techniques for Reachability Analysis
For the reach tube of a linear time-varying system with ellipsoidal bounds on the control variable consider the following approximation problem. Find a tight ellipsoid-valued tube...
Alexander B. Kurzhanski, Pravin Varaiya