2430 search results - page 267 / 486 » Computing Tutte Polynomials |
132
Voted
ISCC
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
117
Voted
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
—In recent years a lot of progress has been made in understanding the behavior of evolutionary computation methods for single- and multi-objective problems. Our aim is to analyze...
139
Voted
COREGRID
2007
Springer
15 years 10 months ago
2007
Springer
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
147
Voted
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Automatic execution time prediction of the Grid applications plays a critical role in making the pervasive Grid more reliable and predictable. However, automatic executio...
134
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...