1603 search results - page 52 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
165
click to vote
ALENEX
2009
15 years 4 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
156
click to vote
DCC
2002
IEEE
16 years 5 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
218
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
138
click to vote
EOR
2006
15 years 6 months ago
2006
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
279
click to vote
AUSSOIS
2001
Springer
15 years 10 months ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...