5138 search results - page 167 / 1028 » Randomized Algorithms for 3-SAT |
154
click to vote
ICS
1998
Tsinghua U.
15 years 10 months ago
1998
Tsinghua U.
Parallel computers are now commonly used for computational science and engineering, and many applications in these areas use random number generators. For some applications, such ...
159
click to vote
ICDM
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents interpretations for association rules. It first introduces Pawlak’s method, and the corresponding algorithm of finding decision rules (a kind of association ...
152
click to vote
ESA
2001
Springer
15 years 11 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
160
click to vote
WEA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
191
click to vote
COCO
1991
Springer
15 years 10 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...