5153 search results - page 759 / 1031 » Introduction to Randomized Algorithms |
139
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
145
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
113
Voted
CP
2008
Springer
15 years 5 months ago
2008
Springer
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
148
click to vote
DMIN
2008
15 years 5 months ago
2008
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
154
click to vote
SODA
1993
ACM
15 years 5 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...