Sciweavers

1914 search results - page 26 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
PPOPP
2012
ACM
12 years 4 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
ATAL
2009
Springer
14 years 3 months ago
Caching schemes for DCOP search algorithms
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
William Yeoh, Pradeep Varakantham, Sven Koenig
SDM
2009
SIAM
112views Data Mining» more  SDM 2009»
14 years 5 months ago
A Re-evaluation of the Over-Searching Phenomenon in Inductive Rule Learning.
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluat...
Frederik Janssen, Johannes Fürnkranz
CORR
2006
Springer
149views Education» more  CORR 2006»
13 years 8 months ago
Synonym search in Wikipedia: Synarcher
The program Synarcher for synonym (and related terms) search in the text corpus of special structure (Wikipedia) was developed. The results of the search are presented in the form...
Andrew Krizhanovsky
DAMON
2009
Springer
13 years 9 months ago
k-ary search on modern processors
This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binar...
Benjamin Schlegel, Rainer Gemulla, Wolfgang Lehner