2976 search results - page 280 / 596 » On the bounded integer programming |
149
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
109
Voted
MP
2007
15 years 4 months ago
2007
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
123
Voted
RC
2007
15 years 4 months ago
2007
In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events,...
176
Voted
ASPLOS
1996
ACM
15 years 9 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
193
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We study the problem of navigating through a database of similar objects using comparisons. This problem is known to be strongly related to the small-world network design problem....