952 search results - page 8 / 191 » Computational complexity of stochastic programming problems |
CCE
2007
13 years 11 months ago
2007
This work describes a stochastic approach for the optimal placement of sensors in municipal water networks to detect maliciously injected contaminants. The model minimizes the exp...
SOFSEM
2009
Springer
14 years 7 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
CORR
2002
Springer
13 years 10 months ago
2002
Springer
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
CDC
2008
IEEE
14 years 5 months ago
2008
IEEE
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
GECCO
2006
Springer
14 years 2 months ago
2006
Springer
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...