A P2p Genetic Algorithm Environment For the Internet
Effectively utilizing distributed computational resources while hiding the complexity of the network programming.
K. C. Tan
Advertisement
Author Archives
On Foster’s information storage and retrieval using AVL trees
Foster [2] has proposed a method of constructing an AVL tree with depth (height) h and the number of items N being fixed and with the weighted sum of the items a maximum. The purpose of this note is to show that this method does not work in general.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved