Sciweavers

2714 search results - page 92 / 543
» Approximation Schemes for Scheduling
Sort
View
DCOSS
2006
Springer
15 years 7 months ago
Contour Approximation in Sensor Networks
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
Chiranjeeb Buragohain, Sorabh Gandhi, John Hershbe...
137
Voted
SIAMDM
2000
159views more  SIAMDM 2000»
15 years 3 months ago
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
Lisa Fleischer
130
Voted
IPL
2002
90views more  IPL 2002»
15 years 3 months ago
On the approximability of two tree drawing conventions
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
Paolo Penna
139
Voted
IPPS
2009
IEEE
15 years 10 months ago
Power-aware dynamic task scheduling for heterogeneous accelerated clusters
Recent accelerators such as GPUs achieve better cost-performance and watt-performance ratio, while the range of their application is more limited than general CPUs. Thus heterogen...
Tomoaki Hamano, Toshio Endo, Satoshi Matsuoka
112
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
The impact of imperfect scheduling on cross-layer rate control in wireless networks
— In this paper, we study cross-layer design for rate control in multihop wireless networks. In our previous work, we have developed an optimal cross-layered rate control scheme ...
Xiaojun Lin, Ness B. Shroff