303 search results - page 53 / 61 » Computing Minimal Spanning Subgraphs in Linear Time |
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we propose an optimal metric for detection ordering in terms of symbol error rate (SER) in vertical Bell-lab Layered Space-Time (V-BLAST) systems. Motivated by t...
CPAIOR
2010
Springer
14 years 10 days ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
ALENEX
2009
13 years 8 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
JCO
2006
13 years 7 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...