Sciweavers

3055 search results - page 333 / 611
» Randomized Search Trees
Sort
View
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
16 years 5 months ago
XML Prefiltering as a String Matching Problem
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...
Christoph Koch, Stefanie Scherzinger, Michael Schm...
109
Voted
WWW
2005
ACM
16 years 4 months ago
Mining web site's topic hierarchy
Searching and navigating a Web site is a tedious task and the hierarchical models, such as site maps, are frequently used for organizing the Web site's content. In this work,...
Nan Liu, C. Yang
243
Voted
CP
2009
Springer
16 years 4 months ago
An Interpolation Method for CLP Traversal
We consider the problem of exploring the search tree of a CLP goal in pursuit of a target property. Essential to such a process is a method of tabling to prevent duplicate explorat...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
98
Voted
SAT
2004
Springer
89views Hardware» more  SAT 2004»
15 years 9 months ago
Using Rewarding Mechanisms for Improving Branching Heuristics
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
Elsa Carvalho, João P. Marques Silva
144
Voted
ICDCSW
2003
IEEE
15 years 9 months ago
Computation of Minimal Uniform Transmission Power in Ad Hoc Wireless Networks
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
Qing Dai, Jie Wu