Sciweavers

447 search results - page 17 / 90
» Approximation Algorithms for the Discrete Time-Cost Tradeoff...
Sort
View
SPAA
2006
ACM
14 years 1 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
SECON
2007
IEEE
14 years 1 months ago
Approximation Algorithm for Base Station Placement in Wireless Sensor Networks
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
Yi Shi, Yiwei Thomas Hou
IPL
2007
99views more  IPL 2007»
13 years 7 months ago
Approximation algorithms for minimizing segments in radiation therapy
Intensity modulated radiation therapy (IMRT) is one of the most effective modalities for modern cancer treatment. The key to successful IMRT treatment hinges on the delivery of a...
Shuang Luan, Jared Saia, Maxwell Young
COMPGEOM
2009
ACM
14 years 1 months ago
PTAS for geometric hitting set problems via local search
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
EUROPAR
2008
Springer
13 years 9 months ago
Optimized Pipelined Parallel Merge Sort on the Cell BE
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
Jörg Keller, Christoph W. Kessler