5580 search results - page 844 / 1116 » Randomized priority algorithms |
105
click to vote
CP
2008
Springer
15 years 4 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...
142
click to vote
DMIN
2008
15 years 4 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...
151
click to vote
SODA
1993
ACM
15 years 4 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...
128
click to vote
COMAD
2009
15 years 4 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
143
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: One of main aims of Molecular Biology is the gain of knowledge about how molecular components interact each other and to understand gene function regulations. Using mi...