657 search results - page 36 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
ICCCN
1997
IEEE
15 years 4 months ago
1997
IEEE
With the advances in server technology, and the advent of fast Gigabit networks, it has become possible to support multi-media applications. To support the requirements for the tr...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
123
click to vote
CVPR
1998
IEEE
16 years 1 months ago
1998
IEEE
We propose a methodfor segmenting gray-value images. By segmentation, we mean a map from the set of pixels to a small set of levels such that each connected component of the set o...
109
click to vote
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
RTSS
2002
IEEE
15 years 4 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...