2031 search results - page 53 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...
AAAI
1994
13 years 9 months ago
1994
In this paper, we describe the partially observable Markov decision process pomdp approach to nding optimal or near-optimal control strategies for partially observable stochastic ...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Efficient design of cognitive radio networks calls for secondary users implementing adaptive resource allocation, which requires knowledge of the channel state information in ord...