952 search results - page 33 / 191 » Computational complexity of stochastic programming problems |
JPDC
2006
13 years 11 months ago
2006
Virtualization provides a vehicle to manage the available resources and enhance their utilization in network computing. System dynamics requires virtual machines be distributed an...
STACS
2005
Springer
14 years 4 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
TNN
2008
13 years 11 months ago
2008
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...
EPEW
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Recently, there is an explosive development of fluid approaches to computer and distributed systems. These approaches are inherently stochastic and generate continuous st...
GECCO
2009
Springer
14 years 5 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...