1933 search results - page 264 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
153
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
138
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
Multiple memory module architecture enjoys higher memory access bandwidth and thus higher performance. Two key problems in gaining high performance in this kind of architecture ar...
135
click to vote
ISCAS
2002
IEEE
15 years 8 months ago
2002
IEEE
Multiple memory module architecture offers higher performance by providing potentially doubled memory bandwidth. Two key problems in gaining high performance in this kind of archi...
151
click to vote
CATS
1998
15 years 5 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
107
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...