952 search results - page 106 / 191 » Computational complexity of stochastic programming problems |
122
click to vote
NIPS
1993
15 years 4 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
189
click to vote
DAC
2005
ACM
16 years 3 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
142
click to vote
IFM
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
112
click to vote
WIMOB
2008
IEEE
15 years 9 months ago
2008
IEEE
—In this paper, we propose two robust precoder designs for multiple-input multiple-output (MIMO) broadcast channels with imperfect channel state information (CSI). First, we cons...
170
click to vote
FPL
2010
Springer
15 years 28 days ago
2010
Springer
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...