3136 search results - page 100 / 628 » Comparison of Clique-Listing Algorithms |
181
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Algebraic factorization is an extremely important part of any logic synthesis system but is computationally expensive. Hence it is important to look at parallel processing to spee...
161
click to vote
AUSAI
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Methods of adaptive constraint satisfaction have recently become of interest to overcome the limitations imposed on “black-box” search algorithms by the no free lunch...
152
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
133
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional...
137
click to vote
FOCS
2008
IEEE
16 years 22 days ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...