Sciweavers

3055 search results - page 33 / 611
» Randomized Search Trees
Sort
View
CN
2007
97views more  CN 2007»
13 years 9 months ago
A longest prefix first search tree for IP lookup
- One of the key design issues for IP routers is the IP Lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a lon...
Lih-Chyau Wuu, Tzong-Jye Liu, Kuo-Ming Chen
CP
2000
Springer
14 years 1 months ago
Analysis of Random Noise and Random Walk Algorithms
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
Bhaskar Krishnamachari, Xi Xie, Bart Selman, Steph...
WEBDB
2004
Springer
154views Database» more  WEBDB 2004»
14 years 2 months ago
Twig Query Processing over Graph-Structured XML Data
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
Zografoula Vagena, Mirella Moura Moro, Vassilis J....
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 26 days ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
NIPS
2004
13 years 10 months ago
Using Random Forests in the Structured Language Model
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...
Peng Xu, Frederick Jelinek