952 search results - page 76 / 191 » Computational complexity of stochastic programming problems |
126
click to vote
CPHYSICS
2006
15 years 18 days ago
2006
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
116
Voted
ICIC
2009
Springer
15 years 7 months ago
2009
Springer
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
111
Voted
CCGRID
2002
IEEE
15 years 5 months ago
2002
IEEE
Despite the large research efforts in the SW–DSM community, this technology has not yet been adapted widely for significant codes beyond benchmark suites. One of the reasons co...
83
Voted
EUROPAR
2003
Springer
15 years 5 months ago
2003
Springer
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
89
Voted
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
Future high-end computers will offer great performance improvements over today’s machines, enabling applications of far greater complexity. However, designers must solve the cha...