1707 search results - page 139 / 342 » Early Integer Programming |
100
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
112
click to vote
EOR
2010
15 years 2 months ago
2010
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
94
Voted
COR
2004
15 years 2 months ago
2004
The strike force asset allocation problem consists of grouping strike force assets into packages and assigning these packages to targets and defensive assets in a way that maximiz...
91
Voted
ACL
2010
15 years 13 days ago
2010
Letter-phoneme alignment is usually generated by a straightforward application of the EM algorithm. We explore several alternative alignment methods that employ phonetics, integer...
142
Voted
SWAT
2010
Springer
15 years 8 days ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...