4377 search results - page 713 / 876 » Mass problems and randomness |
166
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
140
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
159
click to vote
ICCBR
2005
Springer
15 years 11 months ago
2005
Springer
While several researchers have applied case-based reasoning techniques to games, only Ponsen and Spronck (2004) have addressed the challenging problem of learning to win real-time ...
172
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
152
click to vote
IWQOS
2005
Springer
15 years 11 months ago
2005
Springer
Network coding has been recently proposed in information theory as a new dimension of the information multicast problem that helps achieve optimal transmission rate or cost. End ho...