Sciweavers

50 search results - page 3 / 10
» Improved Approximations for TSP with Simple Precedence Const...
Sort
View
TSP
2008
132views more  TSP 2008»
13 years 9 months ago
Differential Modulations for Multinode Cooperative Communications
Abstract--This paper proposes and analyzes differential modulation schemes for two cooperation protocols in multinode cooperative wireless networks; namely, multinode differential ...
Thanongsak Himsoon, W. Pam Siriwongpairat, Weifeng...
ICCD
2006
IEEE
126views Hardware» more  ICCD 2006»
14 years 6 months ago
Task Merging for Dynamic Power Management of Cyclic Applications in Real-Time Multi-Processor Systems
—In this paper we propose the method of task merging and idle period clustering for dynamic power management (DPM) in a real-time system with multiple processing elements. We sho...
Shaobo Liu, Qinru Qiu, Qing Wu
FOCS
2008
IEEE
14 years 4 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
14 years 1 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
FOCS
2005
IEEE
14 years 3 months ago
Approximation Algorithms for Unique Games
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
Luca Trevisan