952 search results - page 83 / 191 » Computational complexity of stochastic programming problems |
107
Voted
ISPASS
2010
IEEE
15 years 7 months ago
2010
IEEE
—While many-core accelerator architectures, such as today’s Graphics Processing Units (GPUs), offer orders of magnitude more raw computing power than contemporary CPUs, their m...
109
Voted
CORR
2008
Springer
15 years 21 days ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
100
Voted
ISIPTA
2003
IEEE
15 years 5 months ago
2003
IEEE
A second-order hierarchical uncertainty model of a system of independent random variables is studied in the paper. It is shown that the complex nonlinear optimization problem for ...
118
click to vote
FOSSACS
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
127
Voted
CP
2008
Springer
15 years 2 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...