2976 search results - page 208 / 596 » On the bounded integer programming |
149
click to vote
ATAL
2007
Springer
16 years 20 days ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
164
click to vote
ICALP
2007
Springer
16 years 19 days ago
2007
Springer
We present lower bounds on the space required to estimate the quantiles of a stream of numerical values. Quantile estimation is perhaps the most studied problem in the data stream ...
193
click to vote
AAAI
2006
15 years 7 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
163
click to vote
DCC
2010
IEEE
16 years 1 months ago
2010
IEEE
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...
178
click to vote
SARA
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...