2976 search results - page 243 / 596 » On the bounded integer programming |
114
click to vote
EMNLP
2008
15 years 7 months ago
2008
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
141
click to vote
UAI
2008
15 years 7 months ago
2008
We present and evaluate new techniques for designing algorithm portfolios. In our view, the problem has both a scheduling aspect and a machine learning aspect. Prior work has larg...
149
click to vote
IPCO
2001
15 years 7 months ago
2001
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
140
click to vote
CORR
2008
Springer
15 years 6 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...
151
click to vote
EOR
2010
15 years 6 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...