3299 search results - page 328 / 660 » A general mathematics of names |
166
click to vote
GECCO
2007
Springer
16 years 27 days ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
194
click to vote
GECCO
2007
Springer
16 years 27 days ago
2007
Springer
Learning Classifier Systems differ from many other classification techniques, in that new rules are constantly discovered and evaluated. This feature of LCS gives rise to an im...
170
click to vote
ICA
2007
Springer
16 years 27 days ago
2007
Springer
The discussion in this paper revolves around the notion of separation problems. The latter can be thought of as a unifying concept which includes a variety of important problems in...
159
click to vote
ISSAC
2007
Springer
16 years 26 days ago
2007
Springer
Shirayanagi and Sweedler proved that a large class of algorithms over the reals can be modified slightly so that they also work correctly on fixed-precision floating-point numb...
196
click to vote
ISSAC
2007
Springer
16 years 26 days ago
2007
Springer
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...