Sciweavers

3055 search results - page 154 / 611
» Randomized Search Trees
Sort
View
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
14 years 4 months ago
One-pass computation-aware motion estimation with adaptive search strategy
— A computation-aware motion estimation algorithm is proposed in this paper. Its goal is to find the best block matching results in a computation-limited and computation-variant...
Yu-Wen Huang, Chia-Lin Lee, Ching-Yeh Chen, Liang-...
ISSTA
2006
ACM
14 years 4 months ago
Tool support for randomized unit testing
There are several problem areas that must be addressed when applying randomization to unit testing. As yet no general, fully automated solution that works for all units has been p...
James H. Andrews, Susmita Haldar, Yong Lei, Felix ...
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
13 years 10 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger
AI
2008
Springer
13 years 11 months ago
Conditional independence and chain event graphs
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
Jim Q. Smith, Paul E. Anderson
SAT
2010
Springer
165views Hardware» more  SAT 2010»
13 years 9 months ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman