602 search results - page 58 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
IWINAC
2005
Springer
15 years 3 months ago
2005
Springer
Whereas the selection concept of Genetic Algorithms (GAs) and Genetic Programming (GP) is basically realized by the selection of above-average parents for reproduction, Evolution S...
CPHYSICS
2006
14 years 9 months ago
2006
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Trading rules are widely used by practitioners as an effective means to mechanize aspects of their reasoning about stock price trends. However, due to the simplicity of these rule...
AOR
2010
14 years 7 months ago
2010
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...