6943 search results - page 996 / 1389 » Representations for evolutionary algorithms |
177
click to vote
SSDBM
2007
IEEE
16 years 1 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
197
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
161
Voted
AUSDM
2007
Springer
16 years 1 months ago
2007
Springer
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
191
click to vote
DBPL
2007
Springer
16 years 1 months ago
2007
Springer
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...
188
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
This paper explores connections between Ficici’s notion of solution concept and order theory. Ficici postulates that algorithms should ascend an order called weak preference; th...