Sciweavers

1301 search results - page 196 / 261
» Bounded Version Vectors
Sort
View
COMPGEOM
2009
ACM
15 years 12 months ago
On the set multi-cover problem in geometric settings
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-P...
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
15 years 11 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
SECON
2008
IEEE
15 years 11 months ago
Decentralized Tick Synchronization for Multi-Hop Medium Slotting in Wireless Ad Hoc Networks Using Black Bursts
—In this paper, we present Black Burst Synchronization (BBS)1 , a novel protocol for decentralized network-wide tick synchronization in wireless ad hoc networks, located at MAC l...
Reinhard Gotzhein, Thomas Kuhn
155
Voted
CEC
2007
IEEE
15 years 11 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
INFOCOM
2007
IEEE
15 years 11 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri