3055 search results - page 178 / 611 » Randomized Search Trees |
89
Voted
ICGA
2007
15 years 19 days ago
2007
We experimented a simple yet powerful optimization for Monte-Carlo Go tree search. It consists in dealing appropriately with strings that have two liberties. The heuristic is cont...
108
click to vote
AP2PC
2004
Springer
15 years 6 months ago
2004
Springer
Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust sel...
87
Voted
JSAC
2007
15 years 18 days ago
2007
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
GCB
2004
Springer
15 years 6 months ago
2004
Springer
: The main contribution of this paper is a novel approach for fast searching in huge structural databases like the PDB. The data structure is based on an adaption of the generalize...
88
Voted
FUIN
2006
15 years 21 days ago
2006
We suggest a variation of the Hellerstein-Koutsoupias--Papadimitriou indexability model for datasets equipped with a similarity measure, with the aim of better understanding the s...