10106 search results - page 1591 / 2022 » Algorithm Selection and Scheduling |
181
click to vote
MDM
2010
Springer
15 years 11 months ago
2010
Springer
—Location information is necessarily uncertain when objects are constantly moving. The cost can be high to maintain precise locations at the application server for all the object...
202
click to vote
STOC
2000
ACM
15 years 11 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
195
click to vote
CIAC
2000
Springer
15 years 11 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
205
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
212
click to vote
ECAL
1995
Springer
15 years 10 months ago
1995
Springer
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...