2354 search results - page 359 / 471 » Randomness, Stochasticity and Approximations |
169
click to vote
GECCO
2007
Springer
16 years 3 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
139
click to vote
IPCCC
2006
IEEE
15 years 12 months ago
2006
IEEE
Recent work on distributed RAM sharing has largely focused on leveraging low-latency networking technologies to optimize remote memory access. In contrast, we revisit the idea of ...
156
click to vote
ENC
2005
IEEE
15 years 11 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
146
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
151
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...