Sciweavers

1376 search results - page 49 / 276
» Searching Trees: An Essay
Sort
View
ACG
2009
Springer
15 years 3 months ago
A Study of UCT and Its Enhancements in an Artificial Game
Abstract. Monte-Carlo tree search, especially the UCT algorithm and its enhancements, have become extremely popular. Because of the importance of this family of algorithms, a deepe...
David Tom, Martin Müller
WWW
2005
ACM
16 years 15 days ago
Focused crawling by exploiting anchor text using decision tree
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
Jun Li, Kazutaka Furuse, Kazunori Yamaguchi
ISCAS
2002
IEEE
94views Hardware» more  ISCAS 2002»
15 years 4 months ago
Minimum power broadcast trees for wireless networks: optimizing using the viability lemma
Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all no...
Robert J. Marks II, Arindam Kumar Das, Mohamed A. ...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
15 years 11 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
15 years 1 months ago
Interpolation search for non-independent data
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
Erik D. Demaine, Thouis R. Jones, Mihai Patrascu