Indexed by：
Abstract：
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has been given, which shows our algorithm can have fewer comparisons than the best known solution by at least a factor of 0.27 under random graph model. Experimental results have also been given, which suggest the advantage of the algorithm under other models.
Keyword：
Reprint 's Address：
Email：
Source ：
Proceedings of the Seventh IASTED International Conference on Advances in Computer Science and Technology
Year： 2006
Page： 91-94
Language： English
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
